NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  bm1.1 GIF version

Theorem bm1.1 2338
Description: Any set defined by a property is the only set defined by that property. Theorem 1.1 of [BellMachover] p. 462. (Contributed by NM, 30-Jun-1994.)
Hypothesis
Ref Expression
bm1.1.1 ⊢ Ⅎxφ
Assertion
Ref Expression
bm1.1 ⊢ (∃x∀y(y ∈ x ↔ φ) → ∃!x∀y(y ∈ x ↔ φ))
Distinct variable group:   x,y
Allowed substitution hints:   φ(x, y)

Proof of Theorem bm1.1
Dummy variable z is distinct from all other variables.
StepHypRef Expression
1 nfv 1619 . . . . . . . 8 ⊢ Ⅎx y ∈ z
2 bm1.1.1 . . . . . . . 8 ⊢ Ⅎxφ
31, 2nfbi 1834 . . . . . . 7 ⊢ Ⅎx(y ∈ z ↔ φ)
43nfal 1842 . . . . . 6 ⊢ Ⅎx∀y(y ∈ z ↔ φ)
5 elequ2 1715 . . . . . . . 8 ⊢ (x = z → (y ∈ x ↔ y ∈ z))
65bibi1d 310 . . . . . . 7 ⊢ (x = z → ((y ∈ x ↔ φ) ↔ (y ∈ z ↔ φ)))
76albidv 1625 . . . . . 6 ⊢ (x = z → (∀y(y ∈ x ↔ φ) ↔ ∀y(y ∈ z ↔ φ)))
84, 7sbie 2038 . . . . 5 ⊢ ([z / x]∀y(y ∈ x ↔ φ) ↔ ∀y(y ∈ z ↔ φ))
9 19.26 1593 . . . . . 6 ⊢ (∀y((y ∈ x ↔ φ) ∧ (y ∈ z ↔ φ)) ↔ (∀y(y ∈ x ↔ φ) ∧ ∀y(y ∈ z ↔ φ)))
10 biantr 897 . . . . . . . 8 ⊢ (((y ∈ x ↔ φ) ∧ (y ∈ z ↔ φ)) → (y ∈ x ↔ y ∈ z))
1110alimi 1559 . . . . . . 7 ⊢ (∀y((y ∈ x ↔ φ) ∧ (y ∈ z ↔ φ)) → ∀y(y ∈ x ↔ y ∈ z))
12 ax-ext 2334 . . . . . . 7 ⊢ (∀y(y ∈ x ↔ y ∈ z) → x = z)
1311, 12syl 15 . . . . . 6 ⊢ (∀y((y ∈ x ↔ φ) ∧ (y ∈ z ↔ φ)) → x = z)
149, 13sylbir 204 . . . . 5 ⊢ ((∀y(y ∈ x ↔ φ) ∧ ∀y(y ∈ z ↔ φ)) → x = z)
158, 14sylan2b 461 . . . 4 ⊢ ((∀y(y ∈ x ↔ φ) ∧ [z / x]∀y(y ∈ x ↔ φ)) → x = z)
1615gen2 1547 . . 3 ⊢ ∀x∀z((∀y(y ∈ x ↔ φ) ∧ [z / x]∀y(y ∈ x ↔ φ)) → x = z)
1716jctr 526 . 2 ⊢ (∃x∀y(y ∈ x ↔ φ) → (∃x∀y(y ∈ x ↔ φ) ∧ ∀x∀z((∀y(y ∈ x ↔ φ) ∧ [z / x]∀y(y ∈ x ↔ φ)) → x = z)))
18 nfv 1619 . . 3 ⊢ Ⅎz∀y(y ∈ x ↔ φ)
1918eu2 2229 . 2 ⊢ (∃!x∀y(y ∈ x ↔ φ) ↔ (∃x∀y(y ∈ x ↔ φ) ∧ ∀x∀z((∀y(y ∈ x ↔ φ) ∧ [z / x]∀y(y ∈ x ↔ φ)) → x = z)))
2017, 19sylibr 203 1 ⊢ (∃x∀y(y ∈ x ↔ φ) → ∃!x∀y(y ∈ x ↔ φ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 176   ∧ wa 358  ∀wal 1540  ∃wex 1541  Ⅎwnf 1544   = wceq 1642  [wsb 1648   ∈ wcel 1710  ∃!weu 2204
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334
This proof depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator