| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > en2prde | GIF version | ||
| Description: A set of size two is an unordered pair of two different elements. (Contributed by Alexander van der Vekens, 8-Dec-2017.) (Revised by Jim Kingdon, 11-Jan-2026.) |
| Ref | Expression |
|---|---|
| en2prde | ⊢ (𝑉 ≈ 2o → ∃𝑎∃𝑏(𝑎 ≠ 𝑏 ∧ 𝑉 = {𝑎, 𝑏})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | en2 6993 | . 2 ⊢ (𝑉 ≈ 2o → ∃𝑎∃𝑏 𝑉 = {𝑎, 𝑏}) | |
| 2 | breq1 4089 | . . . . . 6 ⊢ (𝑉 = {𝑎, 𝑏} → (𝑉 ≈ 2o ↔ {𝑎, 𝑏} ≈ 2o)) | |
| 3 | pr2ne 7388 | . . . . . . 7 ⊢ ((𝑎 ∈ V ∧ 𝑏 ∈ V) → ({𝑎, 𝑏} ≈ 2o ↔ 𝑎 ≠ 𝑏)) | |
| 4 | 3 | el2v 2806 | . . . . . 6 ⊢ ({𝑎, 𝑏} ≈ 2o ↔ 𝑎 ≠ 𝑏) |
| 5 | 2, 4 | bitrdi 196 | . . . . 5 ⊢ (𝑉 = {𝑎, 𝑏} → (𝑉 ≈ 2o ↔ 𝑎 ≠ 𝑏)) |
| 6 | 5 | biimpcd 159 | . . . 4 ⊢ (𝑉 ≈ 2o → (𝑉 = {𝑎, 𝑏} → 𝑎 ≠ 𝑏)) |
| 7 | 6 | ancrd 326 | . . 3 ⊢ (𝑉 ≈ 2o → (𝑉 = {𝑎, 𝑏} → (𝑎 ≠ 𝑏 ∧ 𝑉 = {𝑎, 𝑏}))) |
| 8 | 7 | 2eximdv 1928 | . 2 ⊢ (𝑉 ≈ 2o → (∃𝑎∃𝑏 𝑉 = {𝑎, 𝑏} → ∃𝑎∃𝑏(𝑎 ≠ 𝑏 ∧ 𝑉 = {𝑎, 𝑏}))) |
| 9 | 1, 8 | mpd 13 | 1 ⊢ (𝑉 ≈ 2o → ∃𝑎∃𝑏(𝑎 ≠ 𝑏 ∧ 𝑉 = {𝑎, 𝑏})) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∃wex 1538 ≠ wne 2400 Vcvv 2800 {cpr 3668 class class class wbr 4086 2oc2o 6571 ≈ cen 6902 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-tr 4186 df-id 4388 df-iord 4461 df-on 4463 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-1o 6577 df-2o 6578 df-er 6697 df-en 6905 |
| This theorem is referenced by: umgredg 15984 |
| Copyright terms: Public domain | W3C validator |