Nuprl Lemma : mRuleorI-left_wf
∀[v:mFOLRule()]. mRuleorI-left(v) ∈ 𝔹 supposing ↑mRuleorI?(v)
Proof
Definitions occuring in Statement :
mRuleorI-left: mRuleorI-left(v),
mRuleorI?: mRuleorI?(v),
mFOLRule: mFOLRule(),
assert: ↑b,
bool: 𝔹,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
member: t ∈ T,
ext-eq: A ≡ B,
and: P ∧ Q,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
sq_type: SQType(T),
guard: {T},
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
mRuleorI?: mRuleorI?(v),
pi1: fst(t),
assert: ↑b,
bfalse: ff,
false: False,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
bnot: ¬bb,
mRuleorI-left: mRuleorI-left(v),
pi2: snd(t)
Lemmas referenced :
mFOLRule-ext,
eq_atom_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_atom,
subtype_base_sq,
atom_subtype_base,
unit_wf2,
unit_subtype_base,
it_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_atom,
assert_wf,
mRuleorI?_wf,
mFOLRule_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
introduction,
extract_by_obid,
promote_hyp,
sqequalHypSubstitution,
productElimination,
thin,
hypothesis_subsumption,
hypothesis,
hypothesisEquality,
applyEquality,
sqequalRule,
isectElimination,
tokenEquality,
lambdaFormation,
unionElimination,
equalityElimination,
equalityTransitivity,
equalitySymmetry,
independent_isectElimination,
instantiate,
cumulativity,
atomEquality,
dependent_functionElimination,
independent_functionElimination,
because_Cache,
voidElimination,
dependent_pairFormation
Latex:
\mforall{}[v:mFOLRule()]. mRuleorI-left(v) \mmember{} \mBbbB{} supposing \muparrow{}mRuleorI?(v)
Date html generated:
2018_05_21-PM-10_26_03
Last ObjectModification:
2017_07_26-PM-06_39_23
Theory : minimal-first-order-logic
Home
Index