| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > en2eleq | GIF version | ||
| Description: Express a set of pair cardinality as the unordered pair of a given element and the other element. (Contributed by Stefan O'Rear, 22-Aug-2015.) |
| Ref | Expression |
|---|---|
| en2eleq | ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 = {𝑋, ∪ (𝑃 ∖ {𝑋})}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1onn 6683 | . . . . . . 7 ⊢ 1o ∈ ω | |
| 2 | simpr 110 | . . . . . . . 8 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 ≈ 2o) | |
| 3 | df-2o 6578 | . . . . . . . 8 ⊢ 2o = suc 1o | |
| 4 | 2, 3 | breqtrdi 4127 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 ≈ suc 1o) |
| 5 | simpl 109 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑋 ∈ 𝑃) | |
| 6 | dif1en 7061 | . . . . . . 7 ⊢ ((1o ∈ ω ∧ 𝑃 ≈ suc 1o ∧ 𝑋 ∈ 𝑃) → (𝑃 ∖ {𝑋}) ≈ 1o) | |
| 7 | 1, 4, 5, 6 | mp3an2i 1376 | . . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ≈ 1o) |
| 8 | en1uniel 6973 | . . . . . 6 ⊢ ((𝑃 ∖ {𝑋}) ≈ 1o → ∪ (𝑃 ∖ {𝑋}) ∈ (𝑃 ∖ {𝑋})) | |
| 9 | 7, 8 | syl 14 | . . . . 5 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ∈ (𝑃 ∖ {𝑋})) |
| 10 | eldifsn 3798 | . . . . 5 ⊢ (∪ (𝑃 ∖ {𝑋}) ∈ (𝑃 ∖ {𝑋}) ↔ (∪ (𝑃 ∖ {𝑋}) ∈ 𝑃 ∧ ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)) | |
| 11 | 9, 10 | sylib 122 | . . . 4 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (∪ (𝑃 ∖ {𝑋}) ∈ 𝑃 ∧ ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)) |
| 12 | 11 | simprd 114 | . . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋) |
| 13 | 12 | necomd 2486 | . 2 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑋 ≠ ∪ (𝑃 ∖ {𝑋})) |
| 14 | 11 | simpld 112 | . . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ∈ 𝑃) |
| 15 | en2eqpr 7092 | . . 3 ⊢ ((𝑃 ≈ 2o ∧ 𝑋 ∈ 𝑃 ∧ ∪ (𝑃 ∖ {𝑋}) ∈ 𝑃) → (𝑋 ≠ ∪ (𝑃 ∖ {𝑋}) → 𝑃 = {𝑋, ∪ (𝑃 ∖ {𝑋})})) | |
| 16 | 2, 5, 14, 15 | syl3anc 1271 | . 2 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑋 ≠ ∪ (𝑃 ∖ {𝑋}) → 𝑃 = {𝑋, ∪ (𝑃 ∖ {𝑋})})) |
| 17 | 13, 16 | mpd 13 | 1 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 = {𝑋, ∪ (𝑃 ∖ {𝑋})}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ≠ wne 2400 ∖ cdif 3195 {csn 3667 {cpr 3668 ∪ cuni 3891 class class class wbr 4086 suc csuc 4460 ωcom 4686 1oc1o 6570 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-coll 4202 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-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 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 df-fin 6907 |
| This theorem is referenced by: en2other2 7397 |
| Copyright terms: Public domain | W3C validator |