Nuprl Lemma : uiff_inversion
∀[P,Q:ℙ]. (uiff(Q;P) ⇒ uiff(P;Q))
Proof
Definitions occuring in Statement :
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
prop: ℙ,
implies: P ⇒ Q
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a
Lemmas referenced :
uiff_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
lambdaFormation,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
universeEquality,
productElimination,
independent_pairFormation,
independent_isectElimination
Latex:
\mforall{}[P,Q:\mBbbP{}]. (uiff(Q;P) {}\mRightarrow{} uiff(P;Q))
Date html generated:
2016_05_13-PM-03_07_18
Last ObjectModification:
2016_01_06-PM-05_28_44
Theory : core_2
Home
Index