| 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 5392 | . . . . 5 ⊢ {𝑥} ∈ V | |
| 2 | 1 | rnex 7922 | . . . 4 ⊢ ran {𝑥} ∈ V |
| 3 | 2 | uniex 7758 | . . 3 ⊢ ∪ ran {𝑥} ∈ V |
| 4 | df-2nd 8002 | . . 3 ⊢ 2nd = (𝑥 ∈ V ↦ ∪ ran {𝑥}) | |
| 5 | 3, 4 | fnmpti 6682 | . 2 ⊢ 2nd Fn V |
| 6 | 4 | rnmpt 5938 | . . 3 ⊢ ran 2nd = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = ∪ ran {𝑥}} |
| 7 | vex 3454 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 8 | opex 5431 | . . . . . 6 ⊢ 〈𝑦, 𝑦〉 ∈ V | |
| 9 | 7, 7 | op2nda 6229 | . . . . . . 7 ⊢ ∪ ran {〈𝑦, 𝑦〉} = 𝑦 |
| 10 | 9 | eqcomi 2769 | . . . . . 6 ⊢ 𝑦 = ∪ ran {〈𝑦, 𝑦〉} |
| 11 | sneq 4590 | . . . . . . . . 9 ⊢ (𝑥 = 〈𝑦, 𝑦〉 → {𝑥} = {〈𝑦, 𝑦〉}) | |
| 12 | 11 | rneqd 5919 | . . . . . . . 8 ⊢ (𝑥 = 〈𝑦, 𝑦〉 → ran {𝑥} = ran {〈𝑦, 𝑦〉}) |
| 13 | 12 | unieqd 4879 | . . . . . . 7 ⊢ (𝑥 = 〈𝑦, 𝑦〉 → ∪ ran {𝑥} = ∪ ran {〈𝑦, 𝑦〉}) |
| 14 | 13 | rspceeqv 3598 | . . . . . 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 2895 | . . 3 ⊢ V = {𝑦 ∣ ∃𝑥 ∈ V 𝑦 = ∪ ran {𝑥}} |
| 18 | 6, 17 | eqtr4i 2786 | . 2 ⊢ ran 2nd = V |
| 19 | df-fo 6544 | . 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 1569 ∈ wcel 2144 {cab 2738 ∃wrex 3086 Vcvv 3450 {csn 4584 〈cop 4834 ∪ cuni 4866 ran crn 5651 Fn wfn 6533 –onto→wfo 6536 2nd c2nd 8000 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-fun 6540 df-fn 6541 df-fo 6544 df-2nd 8002 |
| This theorem is used by: br2ndeqg 8024 2ndcof 8032 df2nd2 8112 2ndconst 8114 opco2 8137 iunfo 10626 cdaf 18230 2ndf1 18374 2ndf2 18375 2ndfcl 18377 gsum2dlem2 20190 upxp 23947 uptx 23949 cnmpt2nd 23993 uniiccdif 25904 precsexlem10 28607 precsexlem11 28608 xppreima 33286 2ndimaxp 33287 2ndresdju 33290 xppreima2 33292 2ndpreima 33348 fsuppcurry1 33362 gsummpt2d 33656 gsumpart 33670 cnre2csqima 34589 filnetlem4 37261 |
| Copyright terms: Public domain | W3C validator |