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

Theorem opthprc 5642
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 2827 . . . . 5 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (⟨𝑥, ∅⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ ⟨𝑥, ∅⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}}))))
2 0ex 5226 . . . . . . . . 9 ∅ ∈ V
32snid 4594 . . . . . . . 8 ∅ ∈ {∅}
4 opelxp 5616 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ↔ (𝑥𝐴 ∧ ∅ ∈ {∅}))
53, 4mpbiran2 706 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ↔ 𝑥𝐴)
6 opelxp 5616 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}}) ↔ (𝑥𝐵 ∧ ∅ ∈ {{∅}}))
7 0nep0 5275 . . . . . . . . . 10 ∅ ≠ {∅}
82elsn 4573 . . . . . . . . . 10 (∅ ∈ {{∅}} ↔ ∅ = {∅})
97, 8nemtbir 3039 . . . . . . . . 9 ¬ ∅ ∈ {{∅}}
109bianfi 533 . . . . . . . 8 (∅ ∈ {{∅}} ↔ (𝑥𝐵 ∧ ∅ ∈ {{∅}}))
116, 10bitr4i 277 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}}) ↔ ∅ ∈ {{∅}})
125, 11orbi12i 911 . . . . . 6 ((⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}})) ↔ (𝑥𝐴 ∨ ∅ ∈ {{∅}}))
13 elun 4079 . . . . . 6 (⟨𝑥, ∅⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ (⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}})))
149biorfi 935 . . . . . 6 (𝑥𝐴 ↔ (𝑥𝐴 ∨ ∅ ∈ {{∅}}))
1512, 13, 143bitr4ri 303 . . . . 5 (𝑥𝐴 ↔ ⟨𝑥, ∅⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})))
16 opelxp 5616 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ↔ (𝑥𝐶 ∧ ∅ ∈ {∅}))
173, 16mpbiran2 706 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ↔ 𝑥𝐶)
18 opelxp 5616 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}}) ↔ (𝑥𝐷 ∧ ∅ ∈ {{∅}}))
199bianfi 533 . . . . . . . 8 (∅ ∈ {{∅}} ↔ (𝑥𝐷 ∧ ∅ ∈ {{∅}}))
2018, 19bitr4i 277 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}}) ↔ ∅ ∈ {{∅}})
2117, 20orbi12i 911 . . . . . 6 ((⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}})) ↔ (𝑥𝐶 ∨ ∅ ∈ {{∅}}))
22 elun 4079 . . . . . 6 (⟨𝑥, ∅⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}})))
239biorfi 935 . . . . . 6 (𝑥𝐶 ↔ (𝑥𝐶 ∨ ∅ ∈ {{∅}}))
2421, 22, 233bitr4ri 303 . . . . 5 (𝑥𝐶 ↔ ⟨𝑥, ∅⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
251, 15, 243bitr4g 313 . . . 4 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (𝑥𝐴𝑥𝐶))
2625eqrdv 2736 . . 3 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → 𝐴 = 𝐶)
27 eleq2 2827 . . . . 5 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (⟨𝑥, {∅}⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ ⟨𝑥, {∅}⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}}))))
28 opelxp 5616 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ↔ (𝑥𝐴 ∧ {∅} ∈ {∅}))
29 snex 5349 . . . . . . . . . . . 12 {∅} ∈ V
3029elsn 4573 . . . . . . . . . . 11 ({∅} ∈ {∅} ↔ {∅} = ∅)
31 eqcom 2745 . . . . . . . . . . 11 ({∅} = ∅ ↔ ∅ = {∅})
3230, 31bitri 274 . . . . . . . . . 10 ({∅} ∈ {∅} ↔ ∅ = {∅})
337, 32nemtbir 3039 . . . . . . . . 9 ¬ {∅} ∈ {∅}
3433bianfi 533 . . . . . . . 8 ({∅} ∈ {∅} ↔ (𝑥𝐴 ∧ {∅} ∈ {∅}))
3528, 34bitr4i 277 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ↔ {∅} ∈ {∅})
3629snid 4594 . . . . . . . 8 {∅} ∈ {{∅}}
37 opelxp 5616 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}}) ↔ (𝑥𝐵 ∧ {∅} ∈ {{∅}}))
3836, 37mpbiran2 706 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}}) ↔ 𝑥𝐵)
3935, 38orbi12i 911 . . . . . 6 ((⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}})) ↔ ({∅} ∈ {∅} ∨ 𝑥𝐵))
40 elun 4079 . . . . . 6 (⟨𝑥, {∅}⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ (⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}})))
41 biorf 933 . . . . . . 7 (¬ {∅} ∈ {∅} → (𝑥𝐵 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐵)))
4233, 41ax-mp 5 . . . . . 6 (𝑥𝐵 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐵))
4339, 40, 423bitr4ri 303 . . . . 5 (𝑥𝐵 ↔ ⟨𝑥, {∅}⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})))
44 opelxp 5616 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ↔ (𝑥𝐶 ∧ {∅} ∈ {∅}))
4533bianfi 533 . . . . . . . 8 ({∅} ∈ {∅} ↔ (𝑥𝐶 ∧ {∅} ∈ {∅}))
4644, 45bitr4i 277 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ↔ {∅} ∈ {∅})
47 opelxp 5616 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}}) ↔ (𝑥𝐷 ∧ {∅} ∈ {{∅}}))
4836, 47mpbiran2 706 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}}) ↔ 𝑥𝐷)
4946, 48orbi12i 911 . . . . . 6 ((⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}})) ↔ ({∅} ∈ {∅} ∨ 𝑥𝐷))
50 elun 4079 . . . . . 6 (⟨𝑥, {∅}⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}})))
51 biorf 933 . . . . . . 7 (¬ {∅} ∈ {∅} → (𝑥𝐷 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐷)))
5233, 51ax-mp 5 . . . . . 6 (𝑥𝐷 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐷))
5349, 50, 523bitr4ri 303 . . . . 5 (𝑥𝐷 ↔ ⟨𝑥, {∅}⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
5427, 43, 533bitr4g 313 . . . 4 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (𝑥𝐵𝑥𝐷))
5554eqrdv 2736 . . 3 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → 𝐵 = 𝐷)
5626, 55jca 511 . 2 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (𝐴 = 𝐶𝐵 = 𝐷))
57 xpeq1 5594 . . 3 (𝐴 = 𝐶 → (𝐴 × {∅}) = (𝐶 × {∅}))
58 xpeq1 5594 . . 3 (𝐵 = 𝐷 → (𝐵 × {{∅}}) = (𝐷 × {{∅}}))
59 uneq12 4088 . . 3 (((𝐴 × {∅}) = (𝐶 × {∅}) ∧ (𝐵 × {{∅}}) = (𝐷 × {{∅}})) → ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
6057, 58, 59syl2an 595 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) → ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
6156, 60impbii 208 1 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (𝐴 = 𝐶𝐵 = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205  wa 395  wo 843   = wceq 1539  wcel 2108  cun 3881  c0 4253  {csn 4558  cop 4564   × cxp 5578
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-opab 5133  df-xp 5586
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator