Nuprl Lemma : assert-name_eq
∀[x,y:Name]. uiff(↑name_eq(x;y);x = y ∈ Name)
Proof
Definitions occuring in Statement :
name_eq: name_eq(x;y),
name: Name,
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
name_eq: name_eq(x;y),
all: ∀x:A. B[x],
implies: P ⇒ Q,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
prop: ℙ,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
eqof: eqof(d)
Lemmas referenced :
name-deq_wf,
deq_wf,
name_wf,
equal_wf,
iff_weakening_uiff,
assert_wf,
eqof_wf,
safe-assert-deq,
assert_witness,
uiff_wf,
name_eq_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
extract_by_obid,
hypothesis,
thin,
sqequalHypSubstitution,
isectElimination,
lambdaFormation,
independent_pairFormation,
hypothesisEquality,
because_Cache,
addLevel,
productElimination,
independent_isectElimination,
applyEquality,
independent_functionElimination,
cumulativity,
sqequalRule,
equalityTransitivity,
equalitySymmetry,
dependent_functionElimination,
independent_pairEquality,
isect_memberEquality,
axiomEquality
Latex:
\mforall{}[x,y:Name]. uiff(\muparrow{}name\_eq(x;y);x = y)
Date html generated:
2017_04_17-AM-09_17_16
Last ObjectModification:
2017_02_27-PM-05_21_41
Theory : decidable!equality
Home
Index