Nuprl Lemma : RankEx2-defop
∀[T,S,P:Type]. ∀[R:P ⟶ RankEx2(S;T) ⟶ ℙ].
((∀t:T. (∃x:{P| (R x RankEx2_LeafT(t))}))
⇒ (∀s:S. (∃x:{P| (R x RankEx2_LeafS(s))}))
⇒ (∀d:RankEx2(S;T). ∀s:S. ∀t:T. ((∃x:{P| (R x d)}) ⇒ (∃x:{P| (R x RankEx2_Prod(<<d, s>, t>))})))
⇒ (∀z:S × RankEx2(S;T) + RankEx2(S;T)
(case z of inl(p) => ∃x:{P| (R x (snd(p)))} | inr(d) => ∃x:{P| (R x d)} ⇒ (∃x:{P| (R x RankEx2_Union(z))})))
⇒ (∀L:(S × RankEx2(S;T)) List. ((∀p∈L.∃x:{P| (R x (snd(p)))}) ⇒ (∃x:{P| (R x RankEx2_ListProd(L))})))
⇒ (∀z:T + (RankEx2(S;T) List)
(case z of inl(p) => True | inr(L) => (∀p∈L.∃x:{P| (R x p)}) ⇒ (∃x:{P| (R x RankEx2_UnionList(z))})))
⇒ {∀t:RankEx2(S;T). (∃x:{P| (R x t)})})
Proof
Definitions occuring in Statement :
RankEx2_UnionList: RankEx2_UnionList(unionlist),
RankEx2_ListProd: RankEx2_ListProd(listprod),
RankEx2_Union: RankEx2_Union(union),
RankEx2_Prod: RankEx2_Prod(prod),
RankEx2_LeafS: RankEx2_LeafS(leafs),
RankEx2_LeafT: RankEx2_LeafT(leaft),
RankEx2: RankEx2(S;T),
l_all: (∀x∈L.P[x]),
list: T List,
uall: ∀[x:A]. B[x],
prop: ℙ,
guard: {T},
pi2: snd(t),
all: ∀x:A. B[x],
sq_exists: ∃x:{A| B[x]},
implies: P ⇒ Q,
true: True,
apply: f a,
function: x:A ⟶ B[x],
pair: <a, b>,
product: x:A × B[x],
decide: case b of inl(x) => s[x] | inr(y) => t[y],
union: left + right,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
guard: {T},
member: t ∈ T,
prop: ℙ,
so_lambda: λ2x.t[x],
all: ∀x:A. B[x],
so_apply: x[s],
sq_exists: ∃x:{A| B[x]},
pi2: snd(t),
so_apply: x[s1;s2],
l_all: (∀x∈L.P[x]),
int_seg: {i..j-},
uimplies: b supposing a,
lelt: i ≤ j < k,
and: P ∧ Q,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top,
less_than: a < b,
squash: ↓T
Lemmas referenced :
int_seg_wf,
int_formula_prop_less_lemma,
intformless_wf,
decidable__lt,
int_formula_prop_wf,
int_term_value_var_lemma,
int_term_value_constant_lemma,
int_formula_prop_le_lemma,
int_formula_prop_not_lemma,
int_formula_prop_and_lemma,
itermVar_wf,
itermConstant_wf,
intformle_wf,
intformnot_wf,
intformand_wf,
satisfiable-full-omega-tt,
decidable__le,
length_wf,
int_seg_properties,
select_wf,
RankEx2-definition,
RankEx2_LeafT_wf,
RankEx2_LeafS_wf,
RankEx2_Prod_wf,
RankEx2_Union_wf,
RankEx2_ListProd_wf,
RankEx2_UnionList_wf,
sq_exists_wf,
l_member_wf,
l_all_wf2,
true_wf,
RankEx2_wf,
list_wf,
all_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
lambdaFormation,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
unionEquality,
cumulativity,
hypothesisEquality,
because_Cache,
hypothesis,
sqequalRule,
lambdaEquality,
functionEquality,
unionElimination,
setElimination,
rename,
applyEquality,
setEquality,
productEquality,
productElimination,
independent_pairEquality,
universeEquality,
independent_functionElimination,
dependent_functionElimination,
inlEquality,
inrEquality,
spreadEquality,
independent_isectElimination,
natural_numberEquality,
dependent_pairFormation,
int_eqEquality,
intEquality,
isect_memberEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
imageElimination,
equalityEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[T,S,P:Type]. \mforall{}[R:P {}\mrightarrow{} RankEx2(S;T) {}\mrightarrow{} \mBbbP{}].
((\mforall{}t:T. (\mexists{}x:\{P| (R x RankEx2\_LeafT(t))\}))
{}\mRightarrow{} (\mforall{}s:S. (\mexists{}x:\{P| (R x RankEx2\_LeafS(s))\}))
{}\mRightarrow{} (\mforall{}d:RankEx2(S;T). \mforall{}s:S. \mforall{}t:T. ((\mexists{}x:\{P| (R x d)\}) {}\mRightarrow{} (\mexists{}x:\{P| (R x RankEx2\_Prod(<<d, s>, t>))\}))\000C)
{}\mRightarrow{} (\mforall{}z:S \mtimes{} RankEx2(S;T) + RankEx2(S;T)
(case z of inl(p) => \mexists{}x:\{P| (R x (snd(p)))\} | inr(d) => \mexists{}x:\{P| (R x d)\}
{}\mRightarrow{} (\mexists{}x:\{P| (R x RankEx2\_Union(z))\})))
{}\mRightarrow{} (\mforall{}L:(S \mtimes{} RankEx2(S;T)) List
((\mforall{}p\mmember{}L.\mexists{}x:\{P| (R x (snd(p)))\}) {}\mRightarrow{} (\mexists{}x:\{P| (R x RankEx2\_ListProd(L))\})))
{}\mRightarrow{} (\mforall{}z:T + (RankEx2(S;T) List)
(case z of inl(p) => True | inr(L) => (\mforall{}p\mmember{}L.\mexists{}x:\{P| (R x p)\})
{}\mRightarrow{} (\mexists{}x:\{P| (R x RankEx2\_UnionList(z))\})))
{}\mRightarrow{} \{\mforall{}t:RankEx2(S;T). (\mexists{}x:\{P| (R x t)\})\})
Date html generated:
2016_05_16-AM-09_03_03
Last ObjectModification:
2016_01_17-AM-09_41_12
Theory : C-semantics
Home
Index