Nuprl Lemma : FOLRule_ind_wf_simple
∀[A:Type]. ∀[v:FOLRule()]. ∀[andI,impI:A]. ∀[allI,existsI:var:ℤ ⟶ A]. ∀[orI:left:𝔹 ⟶ A]. ∀[hyp:A].
∀[andE,orE,impE:hypnum:ℕ ⟶ A]. ∀[allE,existsE:hypnum:ℕ ⟶ var:ℤ ⟶ A]. ∀[falseE:hypnum:ℕ ⟶ A].
(case(v)
andI => andI
impI => impI
allI with var => allI[var]
existsI with var => existsI[var]
orI (left?left) => orI[left]
hyp => hyp
andE @hypnum => andE[hypnum]
orE @hypnum => orE[hypnum]
impE @hypnum => impE[hypnum]
allE @hypnum with var => allE[hypnum;var]
existsE @hypnum with var => existsE[hypnum;var]
falseE @hypnum => falseE[hypnum] ∈ A)
Proof
Definitions occuring in Statement :
FOLRule_ind: FOLRule_ind,
FOLRule: FOLRule(),
nat: ℕ,
bool: 𝔹,
uall: ∀[x:A]. B[x],
so_apply: x[s1;s2],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
true: True,
subtype_rel: A ⊆r B,
prop: ℙ,
uimplies: b supposing a
Lemmas referenced :
FOLRule_ind_wf,
true_wf,
FOLRule_wf,
istype-true,
bool_wf,
nat_wf,
subtype_rel_function,
subtype_rel_self,
istype-nat,
istype-int,
istype-universe
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
hypothesis,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
sqequalRule,
lambdaEquality_alt,
universeIsType,
dependent_set_memberEquality_alt,
natural_numberEquality,
functionExtensionality,
applyEquality,
closedConclusion,
intEquality,
because_Cache,
setEquality,
independent_isectElimination,
applyLambdaEquality,
setElimination,
rename,
inhabitedIsType,
functionIsType,
instantiate,
universeEquality
Latex:
\mforall{}[A:Type]. \mforall{}[v:FOLRule()]. \mforall{}[andI,impI:A]. \mforall{}[allI,existsI:var:\mBbbZ{} {}\mrightarrow{} A]. \mforall{}[orI:left:\mBbbB{} {}\mrightarrow{} A]. \mforall{}[hyp:A].
\mforall{}[andE,orE,impE:hypnum:\mBbbN{} {}\mrightarrow{} A]. \mforall{}[allE,existsE:hypnum:\mBbbN{} {}\mrightarrow{} var:\mBbbZ{} {}\mrightarrow{} A]. \mforall{}[falseE:hypnum:\mBbbN{} {}\mrightarrow{} A].
(case(v)
andI => andI
impI => impI
allI with var => allI[var]
existsI with var => existsI[var]
orI (left?left) => orI[left]
hyp => hyp
andE @hypnum => andE[hypnum]
orE @hypnum => orE[hypnum]
impE @hypnum => impE[hypnum]
allE @hypnum with var => allE[hypnum;var]
existsE @hypnum with var => existsE[hypnum;var]
falseE @hypnum => falseE[hypnum] \mmember{} A)
Date html generated:
2020_05_20-AM-09_10_07
Last ObjectModification:
2020_01_24-PM-01_53_51
Theory : minimal-first-order-logic
Home
Index