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

Theorem opthhausdorff0 5111
Description: Justification theorem for the ordered pair definition of Felix Hausdorff in "Grundzüge der Mengenlehre" ("Basics of Set Theory"), 1914, p. 32: 𝐴, 𝐵_H = {{𝐴, 𝑂}, {𝐵, 𝑇}}. Hausdorff used 1 and 2 instead of 𝑂 and 𝑇, but actually, any two different fixed sets will do (e.g., 𝑂 = ∅ and 𝑇 = {∅}, see 0nep0 4967). Furthermore, Hausdorff demanded that 𝑂 and 𝑇 are both different from 𝐴 as well as 𝐵, which is actually not necessary if all involved classes exist as sets (i.e. are not proper classes), in contrast to opthhausdorff 5110. See df-op 4323 for other ordered pair definitions. (Contributed by AV, 12-Jun-2022.)
Hypotheses
Ref Expression
opthhausdorff0.a 𝐴 ∈ V
opthhausdorff0.b 𝐵 ∈ V
opthhausdorff0.c 𝐶 ∈ V
opthhausdorff0.d 𝐷 ∈ V
opthhausdorff0.1 𝑂 ∈ V
opthhausdorff0.2 𝑇 ∈ V
opthhausdorff0.3 𝑂𝑇
Assertion
Ref Expression
opthhausdorff0 ({{𝐴, 𝑂}, {𝐵, 𝑇}} = {{𝐶, 𝑂}, {𝐷, 𝑇}} ↔ (𝐴 = 𝐶𝐵 = 𝐷))

Proof of Theorem opthhausdorff0
StepHypRef Expression
1 prex 5037 . . . 4 {𝐴, 𝑂} ∈ V
2 prex 5037 . . . 4 {𝐵, 𝑇} ∈ V
3 prex 5037 . . . 4 {𝐶, 𝑂} ∈ V
4 prex 5037 . . . 4 {𝐷, 𝑇} ∈ V
51, 2, 3, 4preq12b 4513 . . 3 ({{𝐴, 𝑂}, {𝐵, 𝑇}} = {{𝐶, 𝑂}, {𝐷, 𝑇}} ↔ (({𝐴, 𝑂} = {𝐶, 𝑂} ∧ {𝐵, 𝑇} = {𝐷, 𝑇}) ∨ ({𝐴, 𝑂} = {𝐷, 𝑇} ∧ {𝐵, 𝑇} = {𝐶, 𝑂})))
6 opthhausdorff0.a . . . . . 6 𝐴 ∈ V
7 opthhausdorff0.c . . . . . 6 𝐶 ∈ V
86, 7preqr1 4511 . . . . 5 ({𝐴, 𝑂} = {𝐶, 𝑂} → 𝐴 = 𝐶)
9 opthhausdorff0.b . . . . . 6 𝐵 ∈ V
10 opthhausdorff0.d . . . . . 6 𝐷 ∈ V
119, 10preqr1 4511 . . . . 5 ({𝐵, 𝑇} = {𝐷, 𝑇} → 𝐵 = 𝐷)
128, 11anim12i 600 . . . 4 (({𝐴, 𝑂} = {𝐶, 𝑂} ∧ {𝐵, 𝑇} = {𝐷, 𝑇}) → (𝐴 = 𝐶𝐵 = 𝐷))
13 opthhausdorff0.1 . . . . . . 7 𝑂 ∈ V
14 opthhausdorff0.2 . . . . . . 7 𝑇 ∈ V
156, 13, 10, 14preq12b 4513 . . . . . 6 ({𝐴, 𝑂} = {𝐷, 𝑇} ↔ ((𝐴 = 𝐷𝑂 = 𝑇) ∨ (𝐴 = 𝑇𝑂 = 𝐷)))
16 opthhausdorff0.3 . . . . . . . . 9 𝑂𝑇
17 eqneqall 2954 . . . . . . . . 9 (𝑂 = 𝑇 → (𝑂𝑇 → ({𝐵, 𝑇} = {𝐶, 𝑂} → (𝐴 = 𝐶𝐵 = 𝐷))))
1816, 17mpi 20 . . . . . . . 8 (𝑂 = 𝑇 → ({𝐵, 𝑇} = {𝐶, 𝑂} → (𝐴 = 𝐶𝐵 = 𝐷)))
1918adantl 467 . . . . . . 7 ((𝐴 = 𝐷𝑂 = 𝑇) → ({𝐵, 𝑇} = {𝐶, 𝑂} → (𝐴 = 𝐶𝐵 = 𝐷)))
209, 14, 7, 13preq12b 4513 . . . . . . . . 9 ({𝐵, 𝑇} = {𝐶, 𝑂} ↔ ((𝐵 = 𝐶𝑇 = 𝑂) ∨ (𝐵 = 𝑂𝑇 = 𝐶)))
21 eqneqall 2954 . . . . . . . . . . . . 13 (𝑂 = 𝑇 → (𝑂𝑇 → ((𝐴 = 𝑇𝑂 = 𝐷) → (𝐴 = 𝐶𝐵 = 𝐷))))
2216, 21mpi 20 . . . . . . . . . . . 12 (𝑂 = 𝑇 → ((𝐴 = 𝑇𝑂 = 𝐷) → (𝐴 = 𝐶𝐵 = 𝐷)))
2322eqcoms 2779 . . . . . . . . . . 11 (𝑇 = 𝑂 → ((𝐴 = 𝑇𝑂 = 𝐷) → (𝐴 = 𝐶𝐵 = 𝐷)))
2423adantl 467 . . . . . . . . . 10 ((𝐵 = 𝐶𝑇 = 𝑂) → ((𝐴 = 𝑇𝑂 = 𝐷) → (𝐴 = 𝐶𝐵 = 𝐷)))
25 simpl 468 . . . . . . . . . . . . 13 ((𝐴 = 𝑇𝑂 = 𝐷) → 𝐴 = 𝑇)
26 simpr 471 . . . . . . . . . . . . 13 ((𝐵 = 𝑂𝑇 = 𝐶) → 𝑇 = 𝐶)
2725, 26sylan9eqr 2827 . . . . . . . . . . . 12 (((𝐵 = 𝑂𝑇 = 𝐶) ∧ (𝐴 = 𝑇𝑂 = 𝐷)) → 𝐴 = 𝐶)
28 simpl 468 . . . . . . . . . . . . 13 ((𝐵 = 𝑂𝑇 = 𝐶) → 𝐵 = 𝑂)
29 simpr 471 . . . . . . . . . . . . 13 ((𝐴 = 𝑇𝑂 = 𝐷) → 𝑂 = 𝐷)
3028, 29sylan9eq 2825 . . . . . . . . . . . 12 (((𝐵 = 𝑂𝑇 = 𝐶) ∧ (𝐴 = 𝑇𝑂 = 𝐷)) → 𝐵 = 𝐷)
3127, 30jca 501 . . . . . . . . . . 11 (((𝐵 = 𝑂𝑇 = 𝐶) ∧ (𝐴 = 𝑇𝑂 = 𝐷)) → (𝐴 = 𝐶𝐵 = 𝐷))
3231ex 397 . . . . . . . . . 10 ((𝐵 = 𝑂𝑇 = 𝐶) → ((𝐴 = 𝑇𝑂 = 𝐷) → (𝐴 = 𝐶𝐵 = 𝐷)))
3324, 32jaoi 846 . . . . . . . . 9 (((𝐵 = 𝐶𝑇 = 𝑂) ∨ (𝐵 = 𝑂𝑇 = 𝐶)) → ((𝐴 = 𝑇𝑂 = 𝐷) → (𝐴 = 𝐶𝐵 = 𝐷)))
3420, 33sylbi 207 . . . . . . . 8 ({𝐵, 𝑇} = {𝐶, 𝑂} → ((𝐴 = 𝑇𝑂 = 𝐷) → (𝐴 = 𝐶𝐵 = 𝐷)))
3534com12 32 . . . . . . 7 ((𝐴 = 𝑇𝑂 = 𝐷) → ({𝐵, 𝑇} = {𝐶, 𝑂} → (𝐴 = 𝐶𝐵 = 𝐷)))
3619, 35jaoi 846 . . . . . 6 (((𝐴 = 𝐷𝑂 = 𝑇) ∨ (𝐴 = 𝑇𝑂 = 𝐷)) → ({𝐵, 𝑇} = {𝐶, 𝑂} → (𝐴 = 𝐶𝐵 = 𝐷)))
3715, 36sylbi 207 . . . . 5 ({𝐴, 𝑂} = {𝐷, 𝑇} → ({𝐵, 𝑇} = {𝐶, 𝑂} → (𝐴 = 𝐶𝐵 = 𝐷)))
3837imp 393 . . . 4 (({𝐴, 𝑂} = {𝐷, 𝑇} ∧ {𝐵, 𝑇} = {𝐶, 𝑂}) → (𝐴 = 𝐶𝐵 = 𝐷))
3912, 38jaoi 846 . . 3 ((({𝐴, 𝑂} = {𝐶, 𝑂} ∧ {𝐵, 𝑇} = {𝐷, 𝑇}) ∨ ({𝐴, 𝑂} = {𝐷, 𝑇} ∧ {𝐵, 𝑇} = {𝐶, 𝑂})) → (𝐴 = 𝐶𝐵 = 𝐷))
405, 39sylbi 207 . 2 ({{𝐴, 𝑂}, {𝐵, 𝑇}} = {{𝐶, 𝑂}, {𝐷, 𝑇}} → (𝐴 = 𝐶𝐵 = 𝐷))
41 preq1 4404 . . . 4 (𝐴 = 𝐶 → {𝐴, 𝑂} = {𝐶, 𝑂})
4241adantr 466 . . 3 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐴, 𝑂} = {𝐶, 𝑂})
43 preq1 4404 . . . 4 (𝐵 = 𝐷 → {𝐵, 𝑇} = {𝐷, 𝑇})
4443adantl 467 . . 3 ((𝐴 = 𝐶𝐵 = 𝐷) → {𝐵, 𝑇} = {𝐷, 𝑇})
4542, 44preq12d 4412 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) → {{𝐴, 𝑂}, {𝐵, 𝑇}} = {{𝐶, 𝑂}, {𝐷, 𝑇}})
4640, 45impbii 199 1 ({{𝐴, 𝑂}, {𝐵, 𝑇}} = {{𝐶, 𝑂}, {𝐷, 𝑇}} ↔ (𝐴 = 𝐶𝐵 = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382  wo 836   = wceq 1631  wcel 2145  wne 2943  Vcvv 3351  {cpr 4318
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-v 3353  df-dif 3726  df-un 3728  df-nul 4064  df-sn 4317  df-pr 4319
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator