| 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 9250 | . 2 ⊢ ({𝐴, 𝐵} ≈ 2o → ∃𝑥∃𝑦{𝐴, 𝐵} = {𝑥, 𝑦}) | |
| 2 | breq1 5117 | . . . 4 ⊢ ({𝐴, 𝐵} = {𝑥, 𝑦} → ({𝐴, 𝐵} ≈ 2o ↔ {𝑥, 𝑦} ≈ 2o)) | |
| 3 | vex 3462 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 4 | vex 3462 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 5 | pr2ne 10008 | . . . . . . . . 9 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V) → ({𝑥, 𝑦} ≈ 2o ↔ 𝑥 ≠ 𝑦)) | |
| 6 | 5 | el2v 3465 | . . . . . . . 8 ⊢ ({𝑥, 𝑦} ≈ 2o ↔ 𝑥 ≠ 𝑦) |
| 7 | 6 | biimpi 219 | . . . . . . 7 ⊢ ({𝑥, 𝑦} ≈ 2o → 𝑥 ≠ 𝑦) |
| 8 | preq12nebg 4833 | . . . . . . . 8 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑥 ≠ 𝑦) → ({𝑥, 𝑦} = {𝐴, 𝐵} ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ (𝑥 = 𝐵 ∧ 𝑦 = 𝐴)))) | |
| 9 | eqvisset 3478 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → 𝐴 ∈ V) | |
| 10 | eqvisset 3478 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → 𝐵 ∈ V) | |
| 11 | 9, 10 | anim12i 625 | . . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 12 | eqvisset 3478 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → 𝐵 ∈ V) | |
| 13 | eqvisset 3478 | . . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → 𝐴 ∈ V) | |
| 14 | 12, 13 | anim12ci 626 | . . . . . . . . 9 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 15 | 11, 14 | jaoi 871 | . . . . . . . 8 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ (𝑥 = 𝐵 ∧ 𝑦 = 𝐴)) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 16 | 8, 15 | biimtrdi 256 | . . . . . . 7 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑥 ≠ 𝑦) → ({𝑥, 𝑦} = {𝐴, 𝐵} → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 17 | 3, 4, 7, 16 | mp3an12i 1494 | . . . . . 6 ⊢ ({𝑥, 𝑦} ≈ 2o → ({𝑥, 𝑦} = {𝐴, 𝐵} → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 18 | 17 | com12 33 | . . . . 5 ⊢ ({𝑥, 𝑦} = {𝐴, 𝐵} → ({𝑥, 𝑦} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 19 | 18 | eqcoms 2774 | . . . 4 ⊢ ({𝐴, 𝐵} = {𝑥, 𝑦} → ({𝑥, 𝑦} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 20 | 2, 19 | sylbid 243 | . . 3 ⊢ ({𝐴, 𝐵} = {𝑥, 𝑦} → ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 21 | 20 | exlimivv 1965 | . 2 ⊢ (∃𝑥∃𝑦{𝐴, 𝐵} = {𝑥, 𝑦} → ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 22 | 1, 21 | mpcom 39 | 1 ⊢ ({𝐴, 𝐵} ≈ 2o → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2146 ≠ wne 2961 Vcvv 3458 {cpr 4596 class class class wbr 5114 2oc2o 8456 ≈ cen 8949 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-ord 6370 df-on 6371 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-1o 8462 df-2o 8463 df-en 8953 |
| This theorem is used by: pr2el1 44316 pr2cv1 44317 pr2el2 44318 pr2cv2 44319 pren2 44320 |
| Copyright terms: Public domain | W3C validator |