Nuprl Lemma : ex-approx_wf
∀[e:Atom2]. ∀[t,t':Base]. (ex-approx(e;t;t') ∈ ℙ)
Proof
Definitions occuring in Statement :
ex-approx: ex-approx(e;t;t'),
atom: Atom$n,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
base: Base
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
ex-approx: ex-approx(e;t;t'),
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
so_apply: x[s]
Lemmas referenced :
all_wf,
base_wf,
free-from-atom_wf2,
sqle_wf_base,
atom2_subtype_base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
lambdaEquality,
functionEquality,
hypothesisEquality,
baseApply,
closedConclusion,
baseClosed,
applyEquality,
because_Cache,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
atomnEquality
Latex:
\mforall{}[e:Atom2]. \mforall{}[t,t':Base]. (ex-approx(e;t;t') \mmember{} \mBbbP{})
Date html generated:
2017_02_20-AM-10_56_41
Last ObjectModification:
2017_01_19-PM-05_07_31
Theory : minimal-first-order-logic
Home
Index