| 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 6731 | . . . . . . 7 ⊢ 1o ∈ ω | |
| 2 | simpr 110 | . . . . . . . 8 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 ≈ 2o) | |
| 3 | df-2o 6626 | . . . . . . . 8 ⊢ 2o = suc 1o | |
| 4 | 2, 3 | breqtrdi 4134 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 ≈ suc 1o) |
| 5 | simpl 109 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑋 ∈ 𝑃) | |
| 6 | dif1en 7111 | . . . . . . 7 ⊢ ((1o ∈ ω ∧ 𝑃 ≈ suc 1o ∧ 𝑋 ∈ 𝑃) → (𝑃 ∖ {𝑋}) ≈ 1o) | |
| 7 | 1, 4, 5, 6 | mp3an2i 1379 | . . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ≈ 1o) |
| 8 | en1uniel 7021 | . . . . . 6 ⊢ ((𝑃 ∖ {𝑋}) ≈ 1o → ∪ (𝑃 ∖ {𝑋}) ∈ (𝑃 ∖ {𝑋})) | |
| 9 | 7, 8 | syl 14 | . . . . 5 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ∈ (𝑃 ∖ {𝑋})) |
| 10 | eldifsn 3804 | . . . . 5 ⊢ (∪ (𝑃 ∖ {𝑋}) ∈ (𝑃 ∖ {𝑋}) ↔ (∪ (𝑃 ∖ {𝑋}) ∈ 𝑃 ∧ ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)) | |
| 11 | 9, 10 | sylib 122 | . . . 4 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (∪ (𝑃 ∖ {𝑋}) ∈ 𝑃 ∧ ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)) |
| 12 | 11 | simprd 114 | . . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋) |
| 13 | 12 | necomd 2489 | . 2 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑋 ≠ ∪ (𝑃 ∖ {𝑋})) |
| 14 | 11 | simpld 112 | . . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ∈ 𝑃) |
| 15 | en2eqpr 7142 | . . 3 ⊢ ((𝑃 ≈ 2o ∧ 𝑋 ∈ 𝑃 ∧ ∪ (𝑃 ∖ {𝑋}) ∈ 𝑃) → (𝑋 ≠ ∪ (𝑃 ∖ {𝑋}) → 𝑃 = {𝑋, ∪ (𝑃 ∖ {𝑋})})) | |
| 16 | 2, 5, 14, 15 | syl3anc 1274 | . 2 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑋 ≠ ∪ (𝑃 ∖ {𝑋}) → 𝑃 = {𝑋, ∪ (𝑃 ∖ {𝑋})})) |
| 17 | 13, 16 | mpd 13 | 1 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 = {𝑋, ∪ (𝑃 ∖ {𝑋})}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 ≠ wne 2403 ∖ cdif 3198 {csn 3673 {cpr 3674 ∪ cuni 3898 class class class wbr 4093 suc csuc 4468 ωcom 4694 1oc1o 6618 2oc2o 6619 ≈ cen 6950 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-1o 6625 df-2o 6626 df-er 6745 df-en 6953 df-fin 6955 |
| This theorem is referenced by: en2other2 7450 |
| Copyright terms: Public domain | W3C validator |