| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pr2cv | Structured version Visualization version GIF version | ||
| Description: If an unordered pair is equinumerous to ordinal two, then both parts are sets. (Contributed by RP, 8-Oct-2023.) |
| Ref | Expression |
|---|---|
| pr2cv | ⊢ ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | en2 9220 | . 2 ⊢ ({𝐴, 𝐵} ≈ 2o → ∃𝑥∃𝑦{𝐴, 𝐵} = {𝑥, 𝑦}) | |
| 2 | breq1 5102 | . . . 4 ⊢ ({𝐴, 𝐵} = {𝑥, 𝑦} → ({𝐴, 𝐵} ≈ 2o ↔ {𝑥, 𝑦} ≈ 2o)) | |
| 3 | vex 3457 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 4 | vex 3457 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 5 | pr2ne 9958 | . . . . . . . . 9 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → ({𝑥, 𝑦} ≈ 2o ↔ 𝑥 ≠ 𝑦)) | |
| 6 | 5 | el2v 3460 | . . . . . . . 8 ⊢ ({𝑥, 𝑦} ≈ 2o ↔ 𝑥 ≠ 𝑦) |
| 7 | 6 | biimpi 218 | . . . . . . 7 ⊢ ({𝑥, 𝑦} ≈ 2o → 𝑥 ≠ 𝑦) |
| 8 | preq12nebg 4820 | . . . . . . . 8 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑥 ≠ 𝑦) → ({𝑥, 𝑦} = {𝐴, 𝐵} ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ (𝑥 = 𝐵 ∧ 𝑦 = 𝐴)))) | |
| 9 | eqvisset 3473 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → 𝐴 ∈ V) | |
| 10 | eqvisset 3473 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → 𝐵 ∈ V) | |
| 11 | 9, 10 | anim12i 622 | . . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 12 | eqvisset 3473 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → 𝐵 ∈ V) | |
| 13 | eqvisset 3473 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → 𝐴 ∈ V) | |
| 14 | 12, 13 | anim12ci 623 | . . . . . . . . 9 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 15 | 11, 14 | jaoi 868 | . . . . . . . 8 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ (𝑥 = 𝐵 ∧ 𝑦 = 𝐴)) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 16 | 8, 15 | biimtrdi 255 | . . . . . . 7 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑥 ≠ 𝑦) → ({𝑥, 𝑦} = {𝐴, 𝐵} → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 17 | 3, 4, 7, 16 | mp3an12i 1485 | . . . . . 6 ⊢ ({𝑥, 𝑦} ≈ 2o → ({𝑥, 𝑦} = {𝐴, 𝐵} → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 18 | 17 | com12 32 | . . . . 5 ⊢ ({𝑥, 𝑦} = {𝐴, 𝐵} → ({𝑥, 𝑦} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 19 | 18 | eqcoms 2769 | . . . 4 ⊢ ({𝐴, 𝐵} = {𝑥, 𝑦} → ({𝑥, 𝑦} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 20 | 2, 19 | sylbid 242 | . . 3 ⊢ ({𝐴, 𝐵} = {𝑥, 𝑦} → ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 21 | 20 | exlimivv 1951 | . 2 ⊢ (∃𝑥∃𝑦{𝐴, 𝐵} = {𝑥, 𝑦} → ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 22 | 1, 21 | mpcom 38 | 1 ⊢ ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 ∧ w3a 1097 = wceq 1559 ∃wex 1798 ∈ wcel 2141 ≠ wne 2956 Vcvv 3453 {cpr 4583 class class class wbr 5099 2oc2o 8426 ≈ cen 8920 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-ord 6345 df-on 6346 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-1o 8432 df-2o 8433 df-en 8924 |
| This theorem is referenced by: pr2el1 44089 pr2cv1 44090 pr2el2 44091 pr2cv2 44092 pren2 44093 |
| Copyright terms: Public domain | W3C validator |