| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A mapping is a class of ordered pairs. |
| Ref | Expression |
|---|---|
| fssxp |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frn 3708 |
. . . 4
| |
| 2 | ssid 2124 |
. . . . 5
| |
| 3 | ssxp 3318 |
. . . . 5
| |
| 4 | 2, 3 | mpan 698 |
. . . 4
|
| 5 | 1, 4 | syl 10 |
. . 3
|
| 6 | fdm 3706 |
. . . 4
| |
| 7 | xpeq1 3255 |
. . . 4
| |
| 8 | sseq1 2126 |
. . . 4
| |
| 9 | 6, 7, 8 | 3syl 20 |
. . 3
|
| 10 | 5, 9 | mpbird 194 |
. 2
|
| 11 | frel 3705 |
. . 3
| |
| 12 | relssdmrn 3587 |
. . 3
| |
| 13 | sstr2 2115 |
. . 3
| |
| 14 | 11, 12, 13 | 3syl 20 |
. 2
|
| 15 | 10, 14 | mpd 26 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: funssxp 3713 opelf 3715 fabexg 3728 dff2 3892 dff3 3893 fopabssxp 3900 mapex 4415 mapval2 4422 mapsspw 4428 uniixp 4444 infmap2 7706 lmbrf 8050 iscauf 8059 iscau5 8061 iscaunns 8064 lmclimnn 8084 h2hcau 8968 h2hlm 8969 1alg 10789 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 994 ax-gen 995 ax-8 996 ax-10 998 ax-11 999 ax-12 1000 ax-13 1001 ax-14 1002 ax-17 1003 ax-4 1005 ax-5o 1007 ax-6o 1010 ax-9o 1155 ax-10o 1173 ax-16 1243 ax-11o 1251 ax-ext 1494 ax-sep 2754 ax-pow 2794 ax-pr 2832 |
| This theorem depends on definitions: df-bi 145 df-or 222 df-an 223 df-ex 1013 df-sb 1205 df-eu 1415 df-mo 1416 df-clab 1500 df-cleq 1505 df-clel 1508 df-ne 1624 df-v 1850 df-dif 2093 df-un 2094 df-in 2095 df-ss 2097 df-nul 2325 df-pw 2447 df-sn 2457 df-pr 2458 df-op 2461 df-br 2670 df-opab 2718 df-xp 3239 df-rel 3240 df-cnv 3241 df-dm 3243 df-rn 3244 df-fun 3247 df-fn 3248 df-f 3249 |