Nuprl Lemma : not-isr-assert-isl
∀x:Top + Top. ((¬↑isr(x)) ⇒ (↑isl(x)))
Proof
Definitions occuring in Statement :
assert: ↑b,
isr: isr(x),
isl: isl(x),
top: Top,
all: ∀x:A. B[x],
not: ¬A,
implies: P ⇒ Q,
union: left + right
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
prop: ℙ,
uall: ∀[x:A]. B[x]
Lemmas referenced :
not-isr-isl,
not_wf,
assert_wf,
isr_wf,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
sqequalRule,
cut,
lemma_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
hypothesisEquality,
independent_functionElimination,
hypothesis,
natural_numberEquality,
isectElimination,
unionEquality
Latex:
\mforall{}x:Top + Top. ((\mneg{}\muparrow{}isr(x)) {}\mRightarrow{} (\muparrow{}isl(x)))
Date html generated:
2016_05_13-PM-03_20_27
Last ObjectModification:
2015_12_26-AM-09_10_50
Theory : union
Home
Index