Nuprl Lemma : fpf-join-dom-decl

f,g:x:Id fp-> Type. ∀x:Id.  (↑x ∈ dom(f ⊕ g) ⇐⇒ (↑x ∈ dom(f)) ∨ (↑x ∈ dom(g)))


Proof




Definitions occuring in Statement :  fpf-join: f ⊕ g fpf-dom: x ∈ dom(f) fpf: a:A fp-> B[a] id-deq: IdDeq Id: Id assert: b all: x:A. B[x] iff: ⇐⇒ Q or: P ∨ Q universe: Type
Lemmas :  Id_wf fpf_wf or_wf assert_wf fpf-dom_wf id-deq_wf subtype-fpf2 top_wf subtype_top fpf-join-dom fpf-join_wf iff_wf
\mforall{}f,g:x:Id  fp->  Type.  \mforall{}x:Id.    (\muparrow{}x  \mmember{}  dom(f  \moplus{}  g)  \mLeftarrow{}{}\mRightarrow{}  (\muparrow{}x  \mmember{}  dom(f))  \mvee{}  (\muparrow{}x  \mmember{}  dom(g)))



Date html generated: 2015_07_17-AM-11_13_37
Last ObjectModification: 2015_01_28-AM-07_41_19

Home Index