Nuprl Lemma : fRuleandI?_wf

[v:FOLRule()]. (fRuleandI?(v) ∈ 𝔹)


Proof




Definitions occuring in Statement :  fRuleandI?: fRuleandI?(v) FOLRule: FOLRule() bool: 𝔹 uall: [x:A]. B[x] member: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T ext-eq: A ≡ B and: P ∧ Q subtype_rel: A ⊆B all: x:A. B[x] implies:  Q bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) uimplies: supposing a sq_type: SQType(T) guard: {T} eq_atom: =a y ifthenelse: if then else fi  fRuleandI: andI fRuleandI?: fRuleandI?(v) pi1: fst(t) bfalse: ff exists: x:A. B[x] prop: or: P ∨ Q bnot: ¬bb assert: b false: False fRuleimpI: impI fRuleallI: allI with var fRuleexistsI: existsI with var fRuleorI: fRuleorI(left) fRulehyp: hyp fRuleandE: andE on hypnum fRuleorE: orE on hypnum fRuleimpE: impE on hypnum fRuleallE: allE on hypnum with var fRuleexistsE: existsE on hypnum with var fRulefalseE: falseE on hypnum
Lemmas referenced :  FOLRule-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 btrue_wf eqff_to_assert equal_wf bool_cases_sqequal bool_subtype_base assert-bnot neg_assert_of_eq_atom bfalse_wf FOLRule_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 dependent_pairFormation voidElimination

Latex:
\mforall{}[v:FOLRule()].  (fRuleandI?(v)  \mmember{}  \mBbbB{})



Date html generated: 2018_05_21-PM-10_27_47
Last ObjectModification: 2017_07_26-PM-06_40_29

Theory : minimal-first-order-logic


Home Index