Nuprl Lemma : max_w_unit_l_tree_wf
∀[T:Type]. ∀[u1,u2:T?]. ∀[f:T ⟶ ℤ].  (max_w_unit_l_tree(u1;u2;f) ∈ T?)
Proof
Definitions occuring in Statement : 
max_w_unit_l_tree: max_w_unit_l_tree(u1;u2;f)
, 
uall: ∀[x:A]. B[x]
, 
unit: Unit
, 
member: t ∈ T
, 
function: x:A ⟶ B[x]
, 
union: left + right
, 
int: ℤ
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
max_w_unit_l_tree: max_w_unit_l_tree(u1;u2;f)
Lemmas referenced : 
max_w_ord_wf, 
unit_wf2
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
sqequalRule, 
decideEquality, 
hypothesisEquality, 
inlEquality, 
lemma_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
hypothesis, 
axiomEquality, 
equalityTransitivity, 
equalitySymmetry, 
functionEquality, 
intEquality, 
isect_memberEquality, 
because_Cache, 
unionEquality, 
universeEquality
Latex:
\mforall{}[T:Type].  \mforall{}[u1,u2:T?].  \mforall{}[f:T  {}\mrightarrow{}  \mBbbZ{}].    (max\_w\_unit\_l\_tree(u1;u2;f)  \mmember{}  T?)
Date html generated:
2016_05_16-AM-08_43_53
Last ObjectModification:
2015_12_28-PM-06_41_33
Theory : labeled!trees
Home
Index