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 47498
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 1921 . . . 4 𝑎((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵))
2 nfv 1921 . . . . . . 7 𝑎𝐴, 𝐵⟩ = ⟨𝑥, 𝑦
3 nfcv 2902 . . . . . . . 8 𝑎𝑦
4 nfsbc1v 3750 . . . . . . . 8 𝑎[𝑥 / 𝑎](𝑎𝑅𝑏𝜑)
53, 4nfsbcw 3752 . . . . . . 7 𝑎[𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)
62, 5nfan 1906 . . . . . 6 𝑎(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
76nfex 2333 . . . . 5 𝑎𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
87nfex 2333 . . . 4 𝑎𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
9 nfv 1921 . . . . 5 𝑏((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵))
10 nfv 1921 . . . . . . . 8 𝑏𝐴, 𝐵⟩ = ⟨𝑥, 𝑦
11 nfsbc1v 3750 . . . . . . . 8 𝑏[𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)
1210, 11nfan 1906 . . . . . . 7 𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
1312nfex 2333 . . . . . 6 𝑏𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
1413nfex 2333 . . . . 5 𝑏𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))
15 vex 3436 . . . . . . . . . 10 𝑎 ∈ V
16 vex 3436 . . . . . . . . . 10 𝑏 ∈ V
17 preq12bg 4791 . . . . . . . . . 10 (((𝐴𝑋𝐵𝑋) ∧ (𝑎 ∈ V ∧ 𝑏 ∈ V)) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎))))
1815, 16, 17mpanr12 711 . . . . . . . . 9 ((𝐴𝑋𝐵𝑋) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎))))
19183adant3 1138 . . . . . . . 8 ((𝐴𝑋𝐵𝑋𝐴𝑅𝐵) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎))))
2019adantl 482 . . . . . . 7 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎))))
21 or2expropbilem1 47496 . . . . . . . . . 10 ((𝐴𝑋𝐵𝑋) → ((𝐴 = 𝑎𝐵 = 𝑏) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
22213adant3 1138 . . . . . . . . 9 ((𝐴𝑋𝐵𝑋𝐴𝑅𝐵) → ((𝐴 = 𝑎𝐵 = 𝑏) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
2322adantl 482 . . . . . . . 8 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ((𝐴 = 𝑎𝐵 = 𝑏) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
24 breq12 5084 . . . . . . . . . . . . 13 ((𝐵 = 𝑎𝐴 = 𝑏) → (𝐵𝑅𝐴𝑎𝑅𝑏))
2524ancoms 459 . . . . . . . . . . . 12 ((𝐴 = 𝑏𝐵 = 𝑎) → (𝐵𝑅𝐴𝑎𝑅𝑏))
2625adantl 482 . . . . . . . . . . 11 ((((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏𝐵 = 𝑎)) → (𝐵𝑅𝐴𝑎𝑅𝑏))
27 soasym 5566 . . . . . . . . . . . . . . . . 17 ((𝑅 Or 𝑋 ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴))
2827ex 413 . . . . . . . . . . . . . . . 16 (𝑅 Or 𝑋 → ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴)))
2928adantl 482 . . . . . . . . . . . . . . 15 ((𝑋𝑉𝑅 Or 𝑋) → ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴)))
3029expd 416 . . . . . . . . . . . . . 14 ((𝑋𝑉𝑅 Or 𝑋) → (𝐴𝑋 → (𝐵𝑋 → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴))))
31303imp2 1356 . . . . . . . . . . . . 13 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ¬ 𝐵𝑅𝐴)
3231pm2.21d 121 . . . . . . . . . . . 12 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (𝐵𝑅𝐴 → (𝜑 → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3332adantr 481 . . . . . . . . . . 11 ((((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏𝐵 = 𝑎)) → (𝐵𝑅𝐴 → (𝜑 → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3426, 33sylbird 261 . . . . . . . . . 10 ((((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏𝐵 = 𝑎)) → (𝑎𝑅𝑏 → (𝜑 → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3534impd 411 . . . . . . . . 9 ((((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏𝐵 = 𝑎)) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))))
3635ex 413 . . . . . . . 8 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ((𝐴 = 𝑏𝐵 = 𝑎) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3723, 36jaod 865 . . . . . . 7 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (((𝐴 = 𝑎𝐵 = 𝑏) ∨ (𝐴 = 𝑏𝐵 = 𝑎)) → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3820, 37sylbid 241 . . . . . 6 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → ({𝐴, 𝐵} = {𝑎, 𝑏} → ((𝑎𝑅𝑏𝜑) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))))
3938impd 411 . . . . 5 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))))
409, 14, 39exlimd 2230 . . . 4 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))))
411, 8, 40exlimd 2230 . . 3 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑))))
42 or2expropbilem2 47497 . . 3 (∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) ↔ ∃𝑥𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏𝜑)))
4341, 42imbitrrdi 253 . 2 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑))))
44 oppr 47494 . . . . . 6 ((𝐴𝑋𝐵𝑋) → (⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ → {𝐴, 𝐵} = {𝑎, 𝑏}))
4544anim1d 617 . . . . 5 ((𝐴𝑋𝐵𝑋) → ((⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) → ({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑))))
46452eximdv 1926 . . . 4 ((𝐴𝑋𝐵𝑋) → (∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑))))
47463adant3 1138 . . 3 ((𝐴𝑋𝐵𝑋𝐴𝑅𝐵) → (∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑))))
4847adantl 482 . 2 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑)) → ∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑))))
4943, 48impbid 213 1 (((𝑋𝑉𝑅 Or 𝑋) ∧ (𝐴𝑋𝐵𝑋𝐴𝑅𝐵)) → (∃𝑎𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏𝜑)) ↔ ∃𝑎𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏𝜑))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wo 853  w3a 1092   = wceq 1547  wex 1786  wcel 2119  Vcvv 3432  [wsbc 3730  {cpr 4564  cop 4568   class class class wbr 5079   Or wor 5532
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ral 3055  df-rab 3393  df-v 3434  df-sbc 3731  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-br 5080  df-po 5533  df-so 5534
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator