| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > reldm | Unicode version | ||
| Description: An expression for the domain of a relation. (Contributed by NM, 22-Sep-2013.) |
| Ref | Expression |
|---|---|
| reldm |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | releldm2 6271 |
. . 3
| |
| 2 | vex 2775 |
. . . . . . 7
| |
| 3 | 1stexg 6253 |
. . . . . . 7
| |
| 4 | 2, 3 | ax-mp 5 |
. . . . . 6
|
| 5 | eqid 2205 |
. . . . . 6
| |
| 6 | 4, 5 | fnmpti 5404 |
. . . . 5
|
| 7 | fvelrnb 5626 |
. . . . 5
| |
| 8 | 6, 7 | ax-mp 5 |
. . . 4
|
| 9 | fveq2 5576 |
. . . . . . . 8
| |
| 10 | vex 2775 |
. . . . . . . . 9
| |
| 11 | 1stexg 6253 |
. . . . . . . . 9
| |
| 12 | 10, 11 | ax-mp 5 |
. . . . . . . 8
|
| 13 | 9, 5, 12 | fvmpt 5656 |
. . . . . . 7
|
| 14 | 13 | eqeq1d 2214 |
. . . . . 6
|
| 15 | 14 | rexbiia 2521 |
. . . . 5
|
| 16 | 15 | a1i 9 |
. . . 4
|
| 17 | 8, 16 | bitr2id 193 |
. . 3
|
| 18 | 1, 17 | bitrd 188 |
. 2
|
| 19 | 18 | eqrdv 2203 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-sep 4162 ax-pow 4218 ax-pr 4253 ax-un 4480 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ral 2489 df-rex 2490 df-v 2774 df-sbc 2999 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-br 4045 df-opab 4106 df-mpt 4107 df-id 4340 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-rn 4686 df-iota 5232 df-fun 5273 df-fn 5274 df-f 5275 df-fo 5277 df-fv 5279 df-1st 6226 df-2nd 6227 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |