| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fo2nd | Structured version Visualization version GIF version | ||
| Description: The 2nd function maps the universe onto the universe. (Contributed by NM, 14-Oct-2004.) (Revised by Mario Carneiro, 8-Sep-2013.) |
| Ref | Expression |
|---|---|
| fo2nd | ⊢ 2nd :V–onto→V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vsnex 5393 | . . . . 5 ⊢ {𝑥} ∈ V | |
| 2 | 1 | rnex 7911 | . . . 4 ⊢ ran {𝑥} ∈ V |
| 3 | 2 | uniex 7747 | . . 3 ⊢ ∪ ran {𝑥} ∈ V |
| 4 | df-2nd 7991 | . . 3 ⊢ 2nd = (𝑥 ∈ V ↦ ∪ ran {𝑥}) | |
| 5 | 3, 4 | fnmpti 6674 | . 2 ⊢ 2nd Fn V |
| 6 | 4 | rnmpt 5939 | . . 3 ⊢ ran 2nd = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = ∪ ran {𝑥}} |
| 7 | vex 3455 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 8 | opex 5432 | . . . . . 6 ⊢ 〈𝑦, 𝑦〉 ∈ V | |
| 9 | 7, 7 | op2nda 6222 | . . . . . . 7 ⊢ ∪ ran {〈𝑦, 𝑦〉} = 𝑦 |
| 10 | 9 | eqcomi 2770 | . . . . . 6 ⊢ 𝑦 = ∪ ran {〈𝑦, 𝑦〉} |
| 11 | sneq 4594 | . . . . . . . . 9 ⊢ (𝑥 = 〈𝑦, 𝑦〉 → {𝑥} = {〈𝑦, 𝑦〉}) | |
| 12 | 11 | rneqd 5920 | . . . . . . . 8 ⊢ (𝑥 = 〈𝑦, 𝑦〉 → ran {𝑥} = ran {〈𝑦, 𝑦〉}) |
| 13 | 12 | unieqd 4880 | . . . . . . 7 ⊢ (𝑥 = 〈𝑦, 𝑦〉 → ∪ ran {𝑥} = ∪ ran {〈𝑦, 𝑦〉}) |
| 14 | 13 | rspceeqv 3599 | . . . . . 6 ⊢ ((〈𝑦, 𝑦〉 ∈ V ∧ 𝑦 = ∪ ran {〈𝑦, 𝑦〉}) → ∃𝑥 ∈ V 𝑦 = ∪ ran {𝑥}) |
| 15 | 8, 10, 14 | mp2an 705 | . . . . 5 ⊢ ∃𝑥 ∈ V 𝑦 = ∪ ran {𝑥} |
| 16 | 7, 15 | 2th 267 | . . . 4 ⊢ (𝑦 ∈ V ↔ ∃𝑥 ∈ V 𝑦 = ∪ ran {𝑥}) |
| 17 | 16 | eqabi 2896 | . . 3 ⊢ V = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = ∪ ran {𝑥}} |
| 18 | 6, 17 | eqtr4i 2787 | . 2 ⊢ ran 2nd = V |
| 19 | df-fo 6537 | . 2 ⊢ (2nd :V–onto→V ↔ (2nd Fn V ∧ ran 2nd = V)) | |
| 20 | 5, 18, 19 | mpbir2an 724 | 1 ⊢ 2nd :V–onto→V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 {cab 2739 ∃wrex 3087 Vcvv 3451 {csn 4584 〈cop 4590 ∪ cuni 4867 ran crn 5652 Fn wfn 6526 –onto→wfo 6529 2nd c2nd 7989 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-fun 6533 df-fn 6534 df-fo 6537 df-2nd 7991 |
| This theorem is used by: br2ndeqg 8013 2ndcof 8021 df2nd2 8099 2ndconst 8101 opco2 8124 iunfo 10604 cdaf 18205 2ndf1 18349 2ndf2 18350 2ndfcl 18352 gsum2dlem2 20165 upxp 23922 uptx 23924 cnmpt2nd 23968 uniiccdif 25879 precsexlem10 28584 precsexlem11 28585 xppreima 33221 2ndimaxp 33222 2ndresdju 33225 xppreima2 33227 2ndpreima 33283 fsuppcurry1 33298 gsummpt2d 33592 gsumpart 33606 cnre2csqima 34525 filnetlem4 37139 |
| Copyright terms: Public domain | W3C validator |