Nuprl Lemma : ext-eq_inversion
∀[A,B:Type]. B ≡ A supposing A ≡ B
Proof
Definitions occuring in Statement :
ext-eq: A ≡ B,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
ext-eq: A ≡ B,
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
and: P ∧ Q,
cand: A c∧ B,
subtype_rel: A ⊆r B,
prop: ℙ
Lemmas referenced :
and_wf,
subtype_rel_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
sqequalHypSubstitution,
productElimination,
thin,
hypothesis,
independent_pairFormation,
independent_pairEquality,
axiomEquality,
lemma_by_obid,
isectElimination,
hypothesisEquality,
isect_memberEquality,
because_Cache,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[A,B:Type]. B \mequiv{} A supposing A \mequiv{} B
Date html generated:
2016_05_13-PM-03_19_06
Last ObjectModification:
2015_12_26-AM-09_07_55
Theory : subtype_0
Home
Index