MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  zfpair Structured version   Visualization version   GIF version

Theorem zfpair 5358
Description: The Axiom of Pairing of Zermelo-Fraenkel set theory. Axiom 2 of [TakeutiZaring] p. 15. In some textbooks this is stated as a separate axiom; here we show it is redundant since it can be derived from the other axioms.

This theorem should not be referenced by any proof other than axprALT 5359. Instead, use zfpair2 5371 below so that the uses of the Axiom of Pairing can be more easily identified. (Contributed by NM, 18-Oct-1995.) (New usage is discouraged.)

Assertion
Ref Expression
zfpair {𝑥, 𝑦} ∈ V

Proof of Theorem zfpair
Dummy variables 𝑧 𝑤 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfpr2 4589 . 2 {𝑥, 𝑦} = {𝑤 ∣ (𝑤 = 𝑥𝑤 = 𝑦)}
2 19.43 1884 . . . . 5 (∃𝑧((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) ↔ (∃𝑧(𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ ∃𝑧(𝑧 = {∅} ∧ 𝑤 = 𝑦)))
3 prlem2 1056 . . . . . 6 (((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) ↔ ((𝑧 = ∅ ∨ 𝑧 = {∅}) ∧ ((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦))))
43exbii 1850 . . . . 5 (∃𝑧((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) ↔ ∃𝑧((𝑧 = ∅ ∨ 𝑧 = {∅}) ∧ ((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦))))
5 0ex 5242 . . . . . . . 8 ∅ ∈ V
65isseti 3448 . . . . . . 7 𝑧 𝑧 = ∅
7 19.41v 1951 . . . . . . 7 (∃𝑧(𝑧 = ∅ ∧ 𝑤 = 𝑥) ↔ (∃𝑧 𝑧 = ∅ ∧ 𝑤 = 𝑥))
86, 7mpbiran 710 . . . . . 6 (∃𝑧(𝑧 = ∅ ∧ 𝑤 = 𝑥) ↔ 𝑤 = 𝑥)
9 p0ex 5321 . . . . . . . 8 {∅} ∈ V
109isseti 3448 . . . . . . 7 𝑧 𝑧 = {∅}
11 19.41v 1951 . . . . . . 7 (∃𝑧(𝑧 = {∅} ∧ 𝑤 = 𝑦) ↔ (∃𝑧 𝑧 = {∅} ∧ 𝑤 = 𝑦))
1210, 11mpbiran 710 . . . . . 6 (∃𝑧(𝑧 = {∅} ∧ 𝑤 = 𝑦) ↔ 𝑤 = 𝑦)
138, 12orbi12i 915 . . . . 5 ((∃𝑧(𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ ∃𝑧(𝑧 = {∅} ∧ 𝑤 = 𝑦)) ↔ (𝑤 = 𝑥𝑤 = 𝑦))
142, 4, 133bitr3ri 302 . . . 4 ((𝑤 = 𝑥𝑤 = 𝑦) ↔ ∃𝑧((𝑧 = ∅ ∨ 𝑧 = {∅}) ∧ ((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦))))
1514abbii 2804 . . 3 {𝑤 ∣ (𝑤 = 𝑥𝑤 = 𝑦)} = {𝑤 ∣ ∃𝑧((𝑧 = ∅ ∨ 𝑧 = {∅}) ∧ ((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)))}
16 dfpr2 4589 . . . . 5 {∅, {∅}} = {𝑧 ∣ (𝑧 = ∅ ∨ 𝑧 = {∅})}
17 pp0ex 5323 . . . . 5 {∅, {∅}} ∈ V
1816, 17eqeltrri 2834 . . . 4 {𝑧 ∣ (𝑧 = ∅ ∨ 𝑧 = {∅})} ∈ V
19 equequ2 2028 . . . . . . . 8 (𝑣 = 𝑥 → (𝑤 = 𝑣𝑤 = 𝑥))
20 0inp0 5296 . . . . . . . 8 (𝑧 = ∅ → ¬ 𝑧 = {∅})
2119, 20prlem1 1055 . . . . . . 7 (𝑣 = 𝑥 → (𝑧 = ∅ → (((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) → 𝑤 = 𝑣)))
2221alrimdv 1931 . . . . . 6 (𝑣 = 𝑥 → (𝑧 = ∅ → ∀𝑤(((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) → 𝑤 = 𝑣)))
2322spimevw 1987 . . . . 5 (𝑧 = ∅ → ∃𝑣𝑤(((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) → 𝑤 = 𝑣))
24 orcom 871 . . . . . . . 8 (((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) ↔ ((𝑧 = {∅} ∧ 𝑤 = 𝑦) ∨ (𝑧 = ∅ ∧ 𝑤 = 𝑥)))
25 equequ2 2028 . . . . . . . . 9 (𝑣 = 𝑦 → (𝑤 = 𝑣𝑤 = 𝑦))
2620con2i 139 . . . . . . . . 9 (𝑧 = {∅} → ¬ 𝑧 = ∅)
2725, 26prlem1 1055 . . . . . . . 8 (𝑣 = 𝑦 → (𝑧 = {∅} → (((𝑧 = {∅} ∧ 𝑤 = 𝑦) ∨ (𝑧 = ∅ ∧ 𝑤 = 𝑥)) → 𝑤 = 𝑣)))
2824, 27syl7bi 255 . . . . . . 7 (𝑣 = 𝑦 → (𝑧 = {∅} → (((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) → 𝑤 = 𝑣)))
2928alrimdv 1931 . . . . . 6 (𝑣 = 𝑦 → (𝑧 = {∅} → ∀𝑤(((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) → 𝑤 = 𝑣)))
3029spimevw 1987 . . . . 5 (𝑧 = {∅} → ∃𝑣𝑤(((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) → 𝑤 = 𝑣))
3123, 30jaoi 858 . . . 4 ((𝑧 = ∅ ∨ 𝑧 = {∅}) → ∃𝑣𝑤(((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)) → 𝑤 = 𝑣))
3218, 31zfrep4 5228 . . 3 {𝑤 ∣ ∃𝑧((𝑧 = ∅ ∨ 𝑧 = {∅}) ∧ ((𝑧 = ∅ ∧ 𝑤 = 𝑥) ∨ (𝑧 = {∅} ∧ 𝑤 = 𝑦)))} ∈ V
3315, 32eqeltri 2833 . 2 {𝑤 ∣ (𝑤 = 𝑥𝑤 = 𝑦)} ∈ V
341, 33eqeltri 2833 1 {𝑥, 𝑦} ∈ V
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 848  wal 1540   = wceq 1542  wex 1781  wcel 2114  {cab 2715  Vcvv 3430  c0 4274  {csn 4568  {cpr 4570
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-v 3432  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-pw 4544  df-sn 4569  df-pr 4571
This theorem is referenced by:  axprALT  5359
  Copyright terms: Public domain W3C validator