Nuprl Lemma : or_functionality_wrt_iff

[P1,P2,Q1,Q2:ℙ].  ({P1 ⇐⇒ P2}  {Q1 ⇐⇒ Q2}  {P1 ∨ Q1 ⇐⇒ P2 ∨ Q2})


Proof




Definitions occuring in Statement :  uall: [x:A]. B[x] prop: guard: {T} iff: ⇐⇒ Q implies:  Q or: P ∨ Q
Definitions unfolded in proof :  guard: {T} uall: [x:A]. B[x] implies:  Q iff: ⇐⇒ Q and: P ∧ Q or: P ∨ Q member: t ∈ T prop: rev_implies:  Q
Lemmas referenced :  or_wf iff_wf
Rules used in proof :  sqequalSubstitution sqequalRule sqequalReflexivity sqequalTransitivity computationStep Error :isect_memberFormation_alt,  lambdaFormation sqequalHypSubstitution productElimination thin independent_pairFormation unionElimination inlFormation independent_functionElimination hypothesis hypothesisEquality inrFormation cut introduction extract_by_obid isectElimination Error :inhabitedIsType,  Error :universeIsType,  universeEquality

Latex:
\mforall{}[P1,P2,Q1,Q2:\mBbbP{}].    (\{P1  \mLeftarrow{}{}\mRightarrow{}  P2\}  {}\mRightarrow{}  \{Q1  \mLeftarrow{}{}\mRightarrow{}  Q2\}  {}\mRightarrow{}  \{P1  \mvee{}  Q1  \mLeftarrow{}{}\mRightarrow{}  P2  \mvee{}  Q2\})



Date html generated: 2019_06_20-AM-11_17_10
Last ObjectModification: 2018_09_26-AM-10_24_40

Theory : core_2


Home Index