Nuprl Lemma : RankEx2_size_wf

[S,T:Type]. ∀[p:RankEx2(S;T)].  (RankEx2_size(p) ∈ ℕ)


Proof




Definitions occuring in Statement :  RankEx2_size: RankEx2_size(p) RankEx2: RankEx2(S;T) nat: uall: [x:A]. B[x] member: t ∈ T universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T RankEx2_size: RankEx2_size(p) RankEx2co_size: RankEx2co_size(p) RankEx2: RankEx2(S;T) uimplies: supposing a nat: so_lambda: λ2x.t[x] so_apply: x[s]
Lemmas referenced :  termination nat_wf set-value-type le_wf int-value-type RankEx2co_size_wf RankEx2_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation cut sqequalRule sqequalHypSubstitution setElimination thin rename lemma_by_obid isectElimination hypothesis independent_isectElimination intEquality lambdaEquality natural_numberEquality hypothesisEquality universeEquality

Latex:
\mforall{}[S,T:Type].  \mforall{}[p:RankEx2(S;T)].    (RankEx2\_size(p)  \mmember{}  \mBbbN{})



Date html generated: 2016_05_16-AM-08_59_34
Last ObjectModification: 2015_12_28-PM-06_51_26

Theory : C-semantics


Home Index