Nuprl Lemma : RankEx1-induction
∀[T:Type]. ∀[P:RankEx1(T) ⟶ ℙ].
  ((∀leaf:T. P[RankEx1_Leaf(leaf)])
  
⇒ (∀prod:RankEx1(T) × RankEx1(T). (let u,u1 = prod in P[u] ∧ P[u1] 
⇒ P[RankEx1_Prod(prod)]))
  
⇒ (∀prodl:T × RankEx1(T). (let u,u1 = prodl in P[u1] 
⇒ P[RankEx1_ProdL(prodl)]))
  
⇒ (∀prodr:RankEx1(T) × T. (let u,u1 = prodr in P[u] 
⇒ P[RankEx1_ProdR(prodr)]))
  
⇒ (∀list:RankEx1(T) List. ((∀u∈list.P[u]) 
⇒ P[RankEx1_List(list)]))
  
⇒ {∀v:RankEx1(T). P[v]})
Proof
Definitions occuring in Statement : 
RankEx1_List: RankEx1_List(list)
, 
RankEx1_ProdR: RankEx1_ProdR(prodr)
, 
RankEx1_ProdL: RankEx1_ProdL(prodl)
, 
RankEx1_Prod: RankEx1_Prod(prod)
, 
RankEx1_Leaf: RankEx1_Leaf(leaf)
, 
RankEx1: RankEx1(T)
, 
l_all: (∀x∈L.P[x])
, 
list: T List
, 
uall: ∀[x:A]. B[x]
, 
prop: ℙ
, 
guard: {T}
, 
so_apply: x[s]
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
and: P ∧ Q
, 
function: x:A ⟶ B[x]
, 
spread: spread def, 
product: x:A × B[x]
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
implies: P 
⇒ Q
, 
guard: {T}
, 
so_lambda: λ2x.t[x]
, 
member: t ∈ T
, 
uimplies: b supposing a
, 
subtype_rel: A ⊆r B
, 
nat: ℕ
, 
prop: ℙ
, 
so_apply: x[s]
, 
all: ∀x:A. B[x]
, 
le: A ≤ B
, 
and: P ∧ Q
, 
not: ¬A
, 
false: False
, 
ext-eq: A ≡ B
, 
bool: 𝔹
, 
unit: Unit
, 
it: ⋅
, 
btrue: tt
, 
uiff: uiff(P;Q)
, 
sq_type: SQType(T)
, 
eq_atom: x =a y
, 
ifthenelse: if b then t else f fi 
, 
RankEx1_Leaf: RankEx1_Leaf(leaf)
, 
RankEx1_size: RankEx1_size(p)
, 
bfalse: ff
, 
exists: ∃x:A. B[x]
, 
or: P ∨ Q
, 
bnot: ¬bb
, 
assert: ↑b
, 
RankEx1_Prod: RankEx1_Prod(prod)
, 
pi1: fst(t)
, 
pi2: snd(t)
, 
cand: A c∧ B
, 
ge: i ≥ j 
, 
decidable: Dec(P)
, 
satisfiable_int_formula: satisfiable_int_formula(fmla)
, 
top: Top
, 
int_seg: {i..j-}
, 
lelt: i ≤ j < k
, 
less_than: a < b
, 
squash: ↓T
, 
RankEx1_ProdL: RankEx1_ProdL(prodl)
, 
RankEx1_ProdR: RankEx1_ProdR(prodr)
, 
RankEx1_List: RankEx1_List(list)
, 
l_all: (∀x∈L.P[x])
Lemmas referenced : 
RankEx1_Leaf_wf, 
RankEx1_Prod_wf, 
and_wf, 
RankEx1_ProdL_wf, 
RankEx1_ProdR_wf, 
RankEx1_List_wf, 
l_member_wf, 
l_all_wf2, 
list_wf, 
uall_wf, 
sum-nat-less, 
int_seg_wf, 
length_wf, 
int_seg_properties, 
select_wf, 
length_wf_nat, 
sum-nat, 
lelt_wf, 
int_term_value_subtract_lemma, 
itermSubtract_wf, 
decidable__le, 
subtract_wf, 
int_formula_prop_wf, 
int_term_value_add_lemma, 
int_formula_prop_le_lemma, 
int_term_value_var_lemma, 
int_term_value_constant_lemma, 
int_formula_prop_less_lemma, 
int_formula_prop_not_lemma, 
int_formula_prop_and_lemma, 
itermAdd_wf, 
intformle_wf, 
itermVar_wf, 
itermConstant_wf, 
intformless_wf, 
intformnot_wf, 
intformand_wf, 
satisfiable-full-omega-tt, 
decidable__lt, 
nat_properties, 
neg_assert_of_eq_atom, 
assert-bnot, 
bool_subtype_base, 
bool_cases_sqequal, 
equal_wf, 
eqff_to_assert, 
atom_subtype_base, 
subtype_base_sq, 
assert_of_eq_atom, 
eqtt_to_assert, 
bool_wf, 
eq_atom_wf, 
RankEx1-ext, 
less_than'_wf, 
nat_wf, 
RankEx1_size_wf, 
le_wf, 
isect_wf, 
RankEx1_wf, 
all_wf, 
uniform-comp-nat-induction
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
lambdaFormation, 
cut, 
lemma_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
sqequalRule, 
lambdaEquality, 
hypothesisEquality, 
hypothesis, 
applyEquality, 
because_Cache, 
setElimination, 
rename, 
independent_functionElimination, 
introduction, 
productElimination, 
independent_pairEquality, 
dependent_functionElimination, 
voidElimination, 
axiomEquality, 
equalityTransitivity, 
equalitySymmetry, 
promote_hyp, 
hypothesis_subsumption, 
tokenEquality, 
unionElimination, 
equalityElimination, 
independent_isectElimination, 
instantiate, 
cumulativity, 
atomEquality, 
dependent_pairFormation, 
independent_pairFormation, 
setEquality, 
intEquality, 
natural_numberEquality, 
int_eqEquality, 
isect_memberEquality, 
voidEquality, 
computeAll, 
dependent_set_memberEquality, 
imageElimination, 
equalityEquality, 
functionEquality, 
productEquality, 
spreadEquality, 
universeEquality
Latex:
\mforall{}[T:Type].  \mforall{}[P:RankEx1(T)  {}\mrightarrow{}  \mBbbP{}].
    ((\mforall{}leaf:T.  P[RankEx1\_Leaf(leaf)])
    {}\mRightarrow{}  (\mforall{}prod:RankEx1(T)  \mtimes{}  RankEx1(T).  (let  u,u1  =  prod  in  P[u]  \mwedge{}  P[u1]  {}\mRightarrow{}  P[RankEx1\_Prod(prod)]))
    {}\mRightarrow{}  (\mforall{}prodl:T  \mtimes{}  RankEx1(T).  (let  u,u1  =  prodl  in  P[u1]  {}\mRightarrow{}  P[RankEx1\_ProdL(prodl)]))
    {}\mRightarrow{}  (\mforall{}prodr:RankEx1(T)  \mtimes{}  T.  (let  u,u1  =  prodr  in  P[u]  {}\mRightarrow{}  P[RankEx1\_ProdR(prodr)]))
    {}\mRightarrow{}  (\mforall{}list:RankEx1(T)  List.  ((\mforall{}u\mmember{}list.P[u])  {}\mRightarrow{}  P[RankEx1\_List(list)]))
    {}\mRightarrow{}  \{\mforall{}v:RankEx1(T).  P[v]\})
Date html generated:
2016_05_16-AM-08_58_32
Last ObjectModification:
2016_01_17-AM-09_41_57
Theory : C-semantics
Home
Index