| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > en2eqpr | Structured version Visualization version GIF version | ||
| Description: Building a set with two elements. (Contributed by FL, 11-Aug-2008.) (Revised by Mario Carneiro, 10-Sep-2015.) |
| Ref | Expression |
|---|---|
| en2eqpr | ⊢ ((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐴 ≠ 𝐵 → 𝐶 = {𝐴, 𝐵})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2onn 8580 | . . . . . 6 ⊢ 2o ∈ ω | |
| 2 | nnfi 9104 | . . . . . 6 ⊢ (2o ∈ ω → 2o ∈ Fin) | |
| 3 | 1, 2 | ax-mp 5 | . . . . 5 ⊢ 2o ∈ Fin |
| 4 | simpl1 1193 | . . . . 5 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → 𝐶 ≈ 2o) | |
| 5 | enfii 9122 | . . . . 5 ⊢ ((2o ∈ Fin ∧ 𝐶 ≈ 2o) → 𝐶 ∈ Fin) | |
| 6 | 3, 4, 5 | sylancr 588 | . . . 4 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → 𝐶 ∈ Fin) |
| 7 | simpl2 1194 | . . . . 5 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ 𝐶) | |
| 8 | simpl3 1195 | . . . . 5 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → 𝐵 ∈ 𝐶) | |
| 9 | 7, 8 | prssd 4780 | . . . 4 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ⊆ 𝐶) |
| 10 | enpr2 9926 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ≈ 2o) | |
| 11 | 10 | 3expa 1119 | . . . . . 6 ⊢ (((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ≈ 2o) |
| 12 | 11 | 3adantl1 1168 | . . . . 5 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ≈ 2o) |
| 13 | 4 | ensymd 8954 | . . . . 5 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → 2o ≈ 𝐶) |
| 14 | entr 8955 | . . . . 5 ⊢ (({𝐴, 𝐵} ≈ 2o ∧ 2o ≈ 𝐶) → {𝐴, 𝐵} ≈ 𝐶) | |
| 15 | 12, 13, 14 | syl2anc 585 | . . . 4 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ≈ 𝐶) |
| 16 | fisseneq 9175 | . . . 4 ⊢ ((𝐶 ∈ Fin ∧ {𝐴, 𝐵} ⊆ 𝐶 ∧ {𝐴, 𝐵} ≈ 𝐶) → {𝐴, 𝐵} = 𝐶) | |
| 17 | 6, 9, 15, 16 | syl3anc 1374 | . . 3 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} = 𝐶) |
| 18 | 17 | eqcomd 2743 | . 2 ⊢ (((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) ∧ 𝐴 ≠ 𝐵) → 𝐶 = {𝐴, 𝐵}) |
| 19 | 18 | ex 412 | 1 ⊢ ((𝐶 ≈ 2o ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐴 ≠ 𝐵 → 𝐶 = {𝐴, 𝐵})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ⊆ wss 3903 {cpr 4584 class class class wbr 5100 ωcom 7818 2oc2o 8401 ≈ cen 8892 Fincfn 8895 |
| 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 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| 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-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-om 7819 df-1o 8407 df-2o 8408 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 |
| This theorem is referenced by: isprm2lem 16620 en2top 22941 |
| Copyright terms: Public domain | W3C validator |