Nuprl Lemma : RankEx1_ProdL-prodl_wf

[T:Type]. ∀[v:RankEx1(T)].  RankEx1_ProdL-prodl(v) ∈ T × RankEx1(T) supposing ↑RankEx1_ProdL?(v)


Proof




Definitions occuring in Statement :  RankEx1_ProdL-prodl: RankEx1_ProdL-prodl(v) RankEx1_ProdL?: RankEx1_ProdL?(v) RankEx1: RankEx1(T) assert: b uimplies: supposing a uall: [x:A]. B[x] member: t ∈ T product: x:A × B[x] universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] uimplies: supposing a member: t ∈ T ext-eq: A ≡ B and: P ∧ Q subtype_rel: A ⊆B all: x:A. B[x] implies:  Q bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) sq_type: SQType(T) guard: {T} eq_atom: =a y ifthenelse: if then else fi  RankEx1_ProdL?: RankEx1_ProdL?(v) pi1: fst(t) assert: b bfalse: ff false: False exists: x:A. B[x] prop: or: P ∨ Q bnot: ¬bb RankEx1_ProdL-prodl: RankEx1_ProdL-prodl(v) pi2: snd(t)
Lemmas referenced :  RankEx1-ext eq_atom_wf bool_wf eqtt_to_assert assert_of_eq_atom subtype_base_sq atom_subtype_base eqff_to_assert equal_wf bool_cases_sqequal bool_subtype_base assert-bnot neg_assert_of_eq_atom assert_wf RankEx1_ProdL?_wf RankEx1_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation cut lemma_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality promote_hyp productElimination hypothesis_subsumption hypothesis applyEquality sqequalRule tokenEquality lambdaFormation unionElimination equalityElimination equalityTransitivity equalitySymmetry independent_isectElimination instantiate cumulativity atomEquality dependent_functionElimination independent_functionElimination because_Cache voidElimination dependent_pairFormation independent_pairEquality equalityEquality universeEquality

Latex:
\mforall{}[T:Type].  \mforall{}[v:RankEx1(T)].    RankEx1\_ProdL-prodl(v)  \mmember{}  T  \mtimes{}  RankEx1(T)  supposing  \muparrow{}RankEx1\_ProdL?(v)



Date html generated: 2016_05_16-AM-08_57_57
Last ObjectModification: 2015_12_28-PM-06_52_00

Theory : C-semantics


Home Index