ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  opthprc GIF version

Theorem opthprc 4655
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 2230 . . . . 5 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (⟨𝑥, ∅⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ ⟨𝑥, ∅⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}}))))
2 0ex 4109 . . . . . . . . 9 ∅ ∈ V
32snid 3607 . . . . . . . 8 ∅ ∈ {∅}
4 opelxp 4634 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ↔ (𝑥𝐴 ∧ ∅ ∈ {∅}))
53, 4mpbiran2 931 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ↔ 𝑥𝐴)
6 opelxp 4634 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}}) ↔ (𝑥𝐵 ∧ ∅ ∈ {{∅}}))
7 0nep0 4144 . . . . . . . . . 10 ∅ ≠ {∅}
82elsn 3592 . . . . . . . . . 10 (∅ ∈ {{∅}} ↔ ∅ = {∅})
97, 8nemtbir 2425 . . . . . . . . 9 ¬ ∅ ∈ {{∅}}
109bianfi 937 . . . . . . . 8 (∅ ∈ {{∅}} ↔ (𝑥𝐵 ∧ ∅ ∈ {{∅}}))
116, 10bitr4i 186 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}}) ↔ ∅ ∈ {{∅}})
125, 11orbi12i 754 . . . . . 6 ((⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}})) ↔ (𝑥𝐴 ∨ ∅ ∈ {{∅}}))
13 elun 3263 . . . . . 6 (⟨𝑥, ∅⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ (⟨𝑥, ∅⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐵 × {{∅}})))
149biorfi 736 . . . . . 6 (𝑥𝐴 ↔ (𝑥𝐴 ∨ ∅ ∈ {{∅}}))
1512, 13, 143bitr4ri 212 . . . . 5 (𝑥𝐴 ↔ ⟨𝑥, ∅⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})))
16 opelxp 4634 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ↔ (𝑥𝐶 ∧ ∅ ∈ {∅}))
173, 16mpbiran2 931 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ↔ 𝑥𝐶)
18 opelxp 4634 . . . . . . . 8 (⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}}) ↔ (𝑥𝐷 ∧ ∅ ∈ {{∅}}))
199bianfi 937 . . . . . . . 8 (∅ ∈ {{∅}} ↔ (𝑥𝐷 ∧ ∅ ∈ {{∅}}))
2018, 19bitr4i 186 . . . . . . 7 (⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}}) ↔ ∅ ∈ {{∅}})
2117, 20orbi12i 754 . . . . . 6 ((⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}})) ↔ (𝑥𝐶 ∨ ∅ ∈ {{∅}}))
22 elun 3263 . . . . . 6 (⟨𝑥, ∅⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (⟨𝑥, ∅⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, ∅⟩ ∈ (𝐷 × {{∅}})))
239biorfi 736 . . . . . 6 (𝑥𝐶 ↔ (𝑥𝐶 ∨ ∅ ∈ {{∅}}))
2421, 22, 233bitr4ri 212 . . . . 5 (𝑥𝐶 ↔ ⟨𝑥, ∅⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
251, 15, 243bitr4g 222 . . . 4 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (𝑥𝐴𝑥𝐶))
2625eqrdv 2163 . . 3 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → 𝐴 = 𝐶)
27 eleq2 2230 . . . . 5 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (⟨𝑥, {∅}⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ ⟨𝑥, {∅}⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}}))))
28 opelxp 4634 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ↔ (𝑥𝐴 ∧ {∅} ∈ {∅}))
29 p0ex 4167 . . . . . . . . . . . 12 {∅} ∈ V
3029elsn 3592 . . . . . . . . . . 11 ({∅} ∈ {∅} ↔ {∅} = ∅)
31 eqcom 2167 . . . . . . . . . . 11 ({∅} = ∅ ↔ ∅ = {∅})
3230, 31bitri 183 . . . . . . . . . 10 ({∅} ∈ {∅} ↔ ∅ = {∅})
337, 32nemtbir 2425 . . . . . . . . 9 ¬ {∅} ∈ {∅}
3433bianfi 937 . . . . . . . 8 ({∅} ∈ {∅} ↔ (𝑥𝐴 ∧ {∅} ∈ {∅}))
3528, 34bitr4i 186 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ↔ {∅} ∈ {∅})
3629snid 3607 . . . . . . . 8 {∅} ∈ {{∅}}
37 opelxp 4634 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}}) ↔ (𝑥𝐵 ∧ {∅} ∈ {{∅}}))
3836, 37mpbiran2 931 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}}) ↔ 𝑥𝐵)
3935, 38orbi12i 754 . . . . . 6 ((⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}})) ↔ ({∅} ∈ {∅} ∨ 𝑥𝐵))
40 elun 3263 . . . . . 6 (⟨𝑥, {∅}⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) ↔ (⟨𝑥, {∅}⟩ ∈ (𝐴 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐵 × {{∅}})))
41 biorf 734 . . . . . . 7 (¬ {∅} ∈ {∅} → (𝑥𝐵 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐵)))
4233, 41ax-mp 5 . . . . . 6 (𝑥𝐵 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐵))
4339, 40, 423bitr4ri 212 . . . . 5 (𝑥𝐵 ↔ ⟨𝑥, {∅}⟩ ∈ ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})))
44 opelxp 4634 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ↔ (𝑥𝐶 ∧ {∅} ∈ {∅}))
4533bianfi 937 . . . . . . . 8 ({∅} ∈ {∅} ↔ (𝑥𝐶 ∧ {∅} ∈ {∅}))
4644, 45bitr4i 186 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ↔ {∅} ∈ {∅})
47 opelxp 4634 . . . . . . . 8 (⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}}) ↔ (𝑥𝐷 ∧ {∅} ∈ {{∅}}))
4836, 47mpbiran2 931 . . . . . . 7 (⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}}) ↔ 𝑥𝐷)
4946, 48orbi12i 754 . . . . . 6 ((⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}})) ↔ ({∅} ∈ {∅} ∨ 𝑥𝐷))
50 elun 3263 . . . . . 6 (⟨𝑥, {∅}⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (⟨𝑥, {∅}⟩ ∈ (𝐶 × {∅}) ∨ ⟨𝑥, {∅}⟩ ∈ (𝐷 × {{∅}})))
51 biorf 734 . . . . . . 7 (¬ {∅} ∈ {∅} → (𝑥𝐷 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐷)))
5233, 51ax-mp 5 . . . . . 6 (𝑥𝐷 ↔ ({∅} ∈ {∅} ∨ 𝑥𝐷))
5349, 50, 523bitr4ri 212 . . . . 5 (𝑥𝐷 ↔ ⟨𝑥, {∅}⟩ ∈ ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
5427, 43, 533bitr4g 222 . . . 4 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (𝑥𝐵𝑥𝐷))
5554eqrdv 2163 . . 3 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → 𝐵 = 𝐷)
5626, 55jca 304 . 2 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) → (𝐴 = 𝐶𝐵 = 𝐷))
57 xpeq1 4618 . . 3 (𝐴 = 𝐶 → (𝐴 × {∅}) = (𝐶 × {∅}))
58 xpeq1 4618 . . 3 (𝐵 = 𝐷 → (𝐵 × {{∅}}) = (𝐷 × {{∅}}))
59 uneq12 3271 . . 3 (((𝐴 × {∅}) = (𝐶 × {∅}) ∧ (𝐵 × {{∅}}) = (𝐷 × {{∅}})) → ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
6057, 58, 59syl2an 287 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) → ((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})))
6156, 60impbii 125 1 (((𝐴 × {∅}) ∪ (𝐵 × {{∅}})) = ((𝐶 × {∅}) ∪ (𝐷 × {{∅}})) ↔ (𝐴 = 𝐶𝐵 = 𝐷))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wa 103  wb 104  wo 698   = wceq 1343  wcel 2136  cun 3114  c0 3409  {csn 3576  cop 3579   × cxp 4602
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-v 2728  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-opab 4044  df-xp 4610
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator