Nuprl Lemma : rseteq_weakening
∀[A,B:Set(ℝ)]. rseteq(A;B) supposing A = B ∈ Set(ℝ)
Proof
Definitions occuring in Statement :
rseteq: rseteq(A;B),
rset: Set(ℝ),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
rseteq: rseteq(A;B),
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
member: t ∈ T,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
prop: ℙ,
rev_implies: P ⇐ Q
Latex:
\mforall{}[A,B:Set(\mBbbR{})]. rseteq(A;B) supposing A = B
Date html generated:
2020_05_20-AM-11_27_25
Last ObjectModification:
2019_12_15-PM-07_13_23
Theory : reals
Home
Index