Nuprl Lemma : fRuleorE_wf
∀[hypnum:ℕ]. (orE on hypnum ∈ FOLRule())
Proof
Definitions occuring in Statement :
fRuleorE: orE on hypnum,
FOLRule: FOLRule(),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
FOLRule: FOLRule(),
fRuleorE: orE on hypnum,
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
bfalse: ff,
btrue: tt
Lemmas referenced :
ifthenelse_wf,
eq_atom_wf,
unit_wf2,
bool_wf,
nat_wf,
istype-nat
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
cut,
sqequalRule,
dependent_pairEquality_alt,
tokenEquality,
hypothesisEquality,
universeIsType,
thin,
instantiate,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesis,
universeEquality,
intEquality,
productEquality,
voidEquality
Latex:
\mforall{}[hypnum:\mBbbN{}]. (orE on hypnum \mmember{} FOLRule())
Date html generated:
2020_05_20-AM-09_09_45
Last ObjectModification:
2020_01_24-PM-02_00_25
Theory : minimal-first-order-logic
Home
Index