Nuprl Lemma : vr_test_55
(∀p:ℙ. ((¬¬p) ⇒ p)) ⇒ (∀p:ℙ. (p ∨ (¬p)))
Proof
Definitions occuring in Statement :
prop: ℙ,
all: ∀x:A. B[x],
not: ¬A,
implies: P ⇒ Q,
or: P ∨ Q
Definitions unfolded in proof :
implies: P ⇒ Q,
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
not: ¬A,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
false: False,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
(\mforall{}p:\mBbbP{}. ((\mneg{}\mneg{}p) {}\mRightarrow{} p)) {}\mRightarrow{} (\mforall{}p:\mBbbP{}. (p \mvee{} (\mneg{}p)))
Date html generated:
2016_05_16-AM-10_44_51
Last ObjectModification:
2015_12_28-PM-07_41_17
Theory : halting!dataflow
Home
Index