| 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 9183 | . 2 ⊢ ({𝐴, 𝐵} ≈ 2o → ∃𝑥∃𝑦{𝐴, 𝐵} = {𝑥, 𝑦}) | |
| 2 | breq1 5089 | . . . 4 ⊢ ({𝐴, 𝐵} = {𝑥, 𝑦} → ({𝐴, 𝐵} ≈ 2o ↔ {𝑥, 𝑦} ≈ 2o)) | |
| 3 | vex 3434 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 4 | vex 3434 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 5 | pr2ne 9918 | . . . . . . . . 9 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → ({𝑥, 𝑦} ≈ 2o ↔ 𝑥 ≠ 𝑦)) | |
| 6 | 5 | el2v 3437 | . . . . . . . 8 ⊢ ({𝑥, 𝑦} ≈ 2o ↔ 𝑥 ≠ 𝑦) |
| 7 | 6 | biimpi 216 | . . . . . . 7 ⊢ ({𝑥, 𝑦} ≈ 2o → 𝑥 ≠ 𝑦) |
| 8 | preq12nebg 4807 | . . . . . . . 8 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑥 ≠ 𝑦) → ({𝑥, 𝑦} = {𝐴, 𝐵} ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ (𝑥 = 𝐵 ∧ 𝑦 = 𝐴)))) | |
| 9 | eqvisset 3450 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → 𝐴 ∈ V) | |
| 10 | eqvisset 3450 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → 𝐵 ∈ V) | |
| 11 | 9, 10 | anim12i 614 | . . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 12 | eqvisset 3450 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → 𝐵 ∈ V) | |
| 13 | eqvisset 3450 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → 𝐴 ∈ V) | |
| 14 | 12, 13 | anim12ci 615 | . . . . . . . . 9 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 15 | 11, 14 | jaoi 858 | . . . . . . . 8 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ (𝑥 = 𝐵 ∧ 𝑦 = 𝐴)) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 16 | 8, 15 | biimtrdi 253 | . . . . . . 7 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑥 ≠ 𝑦) → ({𝑥, 𝑦} = {𝐴, 𝐵} → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 17 | 3, 4, 7, 16 | mp3an12i 1468 | . . . . . 6 ⊢ ({𝑥, 𝑦} ≈ 2o → ({𝑥, 𝑦} = {𝐴, 𝐵} → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 18 | 17 | com12 32 | . . . . 5 ⊢ ({𝑥, 𝑦} = {𝐴, 𝐵} → ({𝑥, 𝑦} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 19 | 18 | eqcoms 2745 | . . . 4 ⊢ ({𝐴, 𝐵} = {𝑥, 𝑦} → ({𝑥, 𝑦} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 20 | 2, 19 | sylbid 240 | . . 3 ⊢ ({𝐴, 𝐵} = {𝑥, 𝑦} → ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 21 | 20 | exlimivv 1934 | . 2 ⊢ (∃𝑥∃𝑦{𝐴, 𝐵} = {𝑥, 𝑦} → ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 22 | 1, 21 | mpcom 38 | 1 ⊢ ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ≠ wne 2933 Vcvv 3430 {cpr 4570 class class class wbr 5086 2oc2o 8392 ≈ cen 8883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-ord 6320 df-on 6321 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-1o 8398 df-2o 8399 df-en 8887 |
| This theorem is referenced by: pr2el1 43994 pr2cv1 43995 pr2el2 43996 pr2cv2 43997 pren2 43998 |
| Copyright terms: Public domain | W3C validator |