Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  or2expropbi Structured version   Visualization version   GIF version

Theorem or2expropbi 47626
Description: If two classes are strictly ordered, there is an ordered pair of both classes fulfilling a wff iff there is an unordered pair of both classes fulfilling the wff. (Contributed by AV, 26-Aug-2023.)
Assertion
Ref Expression
or2expropbi (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) ↔ ∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑))))
Distinct variable groups:   𝑎,𝑏,𝐴   𝐵,𝑎,𝑏   𝑅,𝑎,𝑏   𝑉,𝑎,𝑏   𝑋,𝑎,𝑏
Allowed substitution hints:   𝜑(𝑎,𝑏)

Proof of Theorem or2expropbi
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfv 1937 . . . 4 𝑎((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵))
2 nfv 1937 . . . . . . 7 𝑎𝐴, 𝐵⟩ = ⟨𝑥, 𝑦
3 nfcv 2927 . . . . . . . 8 𝑎𝑦
4 nfsbc1v 3767 . . . . . . . 8 𝑎[𝑥 / 𝑎](𝑎𝑅𝑏𝜑)
53, 4nfsbcw 3769 . . . . . . 7 𝑎[𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)
62, 5nfan 1922 . . . . . 6 𝑎(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
76nfex 2359 . . . . 5 𝑎𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
87nfex 2359 . . . 4 𝑎𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
9 nfv 1937 . . . . 5 𝑏((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵))
10 nfv 1937 . . . . . . . 8 𝑏𝐴, 𝐵⟩ = ⟨𝑥, 𝑦
11 nfsbc1v 3767 . . . . . . . 8 𝑏[𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)
1210, 11nfan 1922 . . . . . . 7 𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
1312nfex 2359 . . . . . 6 𝑏𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
1413nfex 2359 . . . . 5 𝑏𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
15 vex 3461 . . . . . . . . . 10 𝑎 ∈ V
16 vex 3461 . . . . . . . . . 10 𝑏 ∈ V
17 preq12bg 4814 . . . . . . . . . 10 (((𝐴𝑋𝐵𝑋) ∧ (𝑎 ∈ V ∧ 𝑏 ∈ V)) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎))))
1815, 16, 17mpanr12 717 . . . . . . . . 9 ((𝐴𝑋𝐵𝑋) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎))))
19183adant3 1148 . . . . . . . 8 ((𝐴𝑋𝐵𝑋𝐴𝑅𝐵) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎))))
2019adantl 486 . . . . . . 7 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎))))
21 or2expropbilem1 47624 . . . . . . . . . 10 ((𝐴𝑋𝐵𝑋) → ((𝐴 = 𝑎𝐵 = 𝑏) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
22213adant3 1148 . . . . . . . . 9 ((𝐴𝑋𝐵𝑋𝐴𝑅𝐵) → ((𝐴 = 𝑎𝐵 = 𝑏) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
2322adantl 486 . . . . . . . 8 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ((𝐴 = 𝑎𝐵 = 𝑏) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
24 breq12 5110 . . . . . . . . . . . . 13 ((𝐵 = 𝑎𝐴 = 𝑏) → (𝐵𝑅𝐴𝑎𝑅𝑏))
2524ancoms 463 . . . . . . . . . . . 12 ((𝐴 = 𝑏𝐵 = 𝑎) → (𝐵𝑅𝐴𝑎𝑅𝑏))
2625adantl 486 . . . . . . . . . . 11 ((((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏𝐵 = 𝑎)) → (𝐵𝑅𝐴𝑎𝑅𝑏))
27 soasym 5593 . . . . . . . . . . . . . . . . 17 ((𝑅 Or 𝑋 ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴))
2827ex 417 . . . . . . . . . . . . . . . 16 (𝑅 Or 𝑋 → ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴)))
2928adantl 486 . . . . . . . . . . . . . . 15 ((𝑋𝑉𝑅 Or 𝑋) → ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴)))
3029expd 420 . . . . . . . . . . . . . 14 ((𝑋𝑉𝑅 Or 𝑋) → (𝐴𝑋 → (𝐵𝑋 → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴))))
31303imp2 1366 . . . . . . . . . . . . 13 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ¬ 𝐵𝑅𝐴)
3231pm2.21d 122 . . . . . . . . . . . 12 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (𝐵𝑅𝐴 → (𝜑 → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3332adantr 485 . . . . . . . . . . 11 ((((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏𝐵 = 𝑎)) → (𝐵𝑅𝐴 → (𝜑 → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3426, 33sylbird 263 . . . . . . . . . 10 ((((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏𝐵 = 𝑎)) → (𝑎𝑅𝑏 → (𝜑 → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3534impd 415 . . . . . . . . 9 ((((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏𝐵 = 𝑎)) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))))
3635ex 417 . . . . . . . 8 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ((𝐴 = 𝑏𝐵 = 𝑎) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3723, 36jaod 872 . . . . . . 7 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎)) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3820, 37sylbid 243 . . . . . 6 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ({𝐴, 𝐵} = {𝑎, 𝑏} → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3938impd 415 . . . . 5 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))))
409, 14, 39exlimd 2256 . . . 4 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))))
411, 8, 40exlimd 2256 . . 3 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))))
42 or2expropbilem2 47625 . . 3 (∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))
4341, 42imbitrrdi 255 . 2 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑))))
44 oppr 47622 . . . . . 6 ((𝐴𝑋𝐵𝑋) → (⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ → {𝐴, 𝐵} = {𝑎, 𝑏}))
4544anim1d 622 . . . . 5 ((𝐴𝑋𝐵𝑋) → ((⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) → ({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑))))
46452eximdv 1942 . . . 4 ((𝐴𝑋𝐵𝑋) → (∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑))))
47463adant3 1148 . . 3 ((𝐴𝑋𝐵𝑋𝐴𝑅𝐵) → (∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑))))
4847adantl 486 . 2 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑))))
4943, 48impbid 215 1 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) ↔ ∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400  wo 860  w3a 1101   = wceq 1563  wex 1802  wcel 2145  Vcvv 3457  [wsbc 3747  {cpr 4587  cop 4591   class class class wbr 5105   Or wor 5559
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3080  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-po 5560  df-so 5561
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator