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

Theorem opthprc 5696
Description: Justification theorem for an ordered pair definition that works for any classes, including proper classes. This is a possible definition implied by the footnote in [Jech] p. 78, which says, "The sophisticated reader will not object to our use of a pair of classes." (Contributed by NM, 28-Sep-2003.)
Assertion
Ref Expression
opthprc (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (𝐴 = 𝐶𝐵 = 𝐷))

Proof of Theorem opthprc
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eleq2 2826 . . . . 5 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (⟨𝑥, ∅⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ ⟨𝑥, ∅⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}}))))
2 0ex 5254 . . . . . . . . 9 ∅ ∈ V
32snid 4621 . . . . . . . 8 ∅ ∈ {∅}
4 opelxp 5668 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ↔ (𝑥𝐴 ∧ ∅ ∈ {∅}))
53, 4mpbiran2 711 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ↔ 𝑥𝐴)
6 opelxp 5668 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}}) ↔ (𝑥𝐵 ∧ ∅ ∈ {{∅}}))
7 0nep0 5305 . . . . . . . . . 10 ∅ ≠ {∅}
82elsn 4597 . . . . . . . . . 10 (∅ ∈ {{∅}} ↔ ∅ = {∅})
97, 8nemtbir 3029 . . . . . . . . 9 ¬ ∅ ∈ {{∅}}
109bianfi 533 . . . . . . . 8 (∅ ∈ {{∅}} ↔ (𝑥𝐵 ∧ ∅ ∈ {{∅}}))
116, 10bitr4i 278 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}}) ↔ ∅ ∈ {{∅}})
125, 11orbi12i 915 . . . . . 6 ((⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}})) ↔ (𝑥𝐴 ∨ ∅ ∈ {{∅}}))
13 elun 4107 . . . . . 6 (⟨𝑥, ∅⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ (⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}})))
149biorfri 940 . . . . . 6 (𝑥𝐴 ↔ (𝑥𝐴 ∨ ∅ ∈ {{∅}}))
1512, 13, 143bitr4ri 304 . . . . 5 (𝑥𝐴 ↔ ⟨𝑥, ∅⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})))
16 opelxp 5668 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ↔ (𝑥𝐶 ∧ ∅ ∈ {∅}))
173, 16mpbiran2 711 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ↔ 𝑥𝐶)
18 opelxp 5668 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}}) ↔ (𝑥𝐷 ∧ ∅ ∈ {{∅}}))
199bianfi 533 . . . . . . . 8 (∅ ∈ {{∅}} ↔ (𝑥𝐷 ∧ ∅ ∈ {{∅}}))
2018, 19bitr4i 278 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}}) ↔ ∅ ∈ {{∅}})
2117, 20orbi12i 915 . . . . . 6 ((⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}})) ↔ (𝑥𝐶 ∨ ∅ ∈ {{∅}}))
22 elun 4107 . . . . . 6 (⟨𝑥, ∅⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}})))
239biorfri 940 . . . . . 6 (𝑥𝐶 ↔ (𝑥𝐶 ∨ ∅ ∈ {{∅}}))
2421, 22, 233bitr4ri 304 . . . . 5 (𝑥𝐶 ↔ ⟨𝑥, ∅⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
251, 15, 243bitr4g 314 . . . 4 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (𝑥𝐴𝑥𝐶))
2625eqrdv 2735 . . 3 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → 𝐴 = 𝐶)
27 eleq2 2826 . . . . 5 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (⟨𝑥, {∅}⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ ⟨𝑥, {∅}⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}}))))
28 opelxp 5668 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ↔ (𝑥𝐴 ∧ {∅} ∈ {∅}))
29 snex 5385 . . . . . . . . . . . 12 {∅} ∈ V
3029elsn 4597 . . . . . . . . . . 11 ({∅} ∈ {∅} ↔ {∅} = ∅)
31 eqcom 2744 . . . . . . . . . . 11 ({∅} = ∅ ↔ ∅ = {∅})
3230, 31bitri 275 . . . . . . . . . 10 ({∅} ∈ {∅} ↔ ∅ = {∅})
337, 32nemtbir 3029 . . . . . . . . 9 ¬ {∅} ∈ {∅}
3433bianfi 533 . . . . . . . 8 ({∅} ∈ {∅} ↔ (𝑥𝐴 ∧ {∅} ∈ {∅}))
3528, 34bitr4i 278 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ↔ {∅} ∈ {∅})
3629snid 4621 . . . . . . . 8 {∅} ∈ {{∅}}
37 opelxp 5668 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}}) ↔ (𝑥𝐵 ∧ {∅} ∈ {{∅}}))
3836, 37mpbiran2 711 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}}) ↔ 𝑥𝐵)
3935, 38orbi12i 915 . . . . . 6 ((⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}})) ↔ ({∅} ∈ {∅} ∨ 𝑥𝐵))
40 elun 4107 . . . . . 6 (⟨𝑥, {∅}⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ (⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}})))
4133biorfi 939 . . . . . 6 (𝑥𝐵 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐵))
4239, 40, 413bitr4ri 304 . . . . 5 (𝑥𝐵 ↔ ⟨𝑥, {∅}⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})))
43 opelxp 5668 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ↔ (𝑥𝐶 ∧ {∅} ∈ {∅}))
4433bianfi 533 . . . . . . . 8 ({∅} ∈ {∅} ↔ (𝑥𝐶 ∧ {∅} ∈ {∅}))
4543, 44bitr4i 278 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ↔ {∅} ∈ {∅})
46 opelxp 5668 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}}) ↔ (𝑥𝐷 ∧ {∅} ∈ {{∅}}))
4736, 46mpbiran2 711 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}}) ↔ 𝑥𝐷)
4845, 47orbi12i 915 . . . . . 6 ((⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}})) ↔ ({∅} ∈ {∅} ∨ 𝑥𝐷))
49 elun 4107 . . . . . 6 (⟨𝑥, {∅}⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}})))
5033biorfi 939 . . . . . 6 (𝑥𝐷 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐷))
5148, 49, 503bitr4ri 304 . . . . 5 (𝑥𝐷 ↔ ⟨𝑥, {∅}⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
5227, 42, 513bitr4g 314 . . . 4 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (𝑥𝐵𝑥𝐷))
5352eqrdv 2735 . . 3 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → 𝐵 = 𝐷)
5426, 53jca 511 . 2 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (𝐴 = 𝐶𝐵 = 𝐷))
55 xpeq1 5646 . . 3 (𝐴 = 𝐶 → (𝐴 × {∅}) = (𝐶 × {∅}))
56 xpeq1 5646 . . 3 (𝐵 = 𝐷 → (𝐵 × {{∅}}) = (𝐷 × {{∅}}))
57 uneq12 4117 . . 3 (((𝐴 × {∅}) = (𝐶 × {∅}) ∧ (𝐵 × {{∅}}) = (𝐷 × {{∅}})) → ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
5855, 56, 57syl2an 597 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) → ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
5954, 58impbii 209 1 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (𝐴 = 𝐶𝐵 = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wo 848   = wceq 1542  wcel 2114  cun 3901  c0 4287  {csn 4582  cop 4588   × cxp 5630
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-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-opab 5163  df-xp 5638
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator