| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > reldm | GIF version | ||
| Description: An expression for the domain of a relation. (Contributed by NM, 22-Sep-2013.) |
| Ref | Expression |
|---|---|
| reldm | ⊢ (Rel 𝐴 → dom 𝐴 = ran (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | releldm2 6409 | . . 3 ⊢ (Rel 𝐴 → (𝑦 ∈ dom 𝐴 ↔ ∃𝑧 ∈ 𝐴 (1st ‘𝑧) = 𝑦)) | |
| 2 | vex 2824 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 3 | 1stexg 6391 | . . . . . . 7 ⊢ (𝑥 ∈ V → (1st ‘𝑥) ∈ V) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (1st ‘𝑥) ∈ V |
| 5 | eqid 2238 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) | |
| 6 | 4, 5 | fnmpti 5507 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) Fn 𝐴 |
| 7 | fvelrnb 5744 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) Fn 𝐴 → (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) ↔ ∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = 𝑦)) | |
| 8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) ↔ ∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = 𝑦) |
| 9 | fveq2 5690 | . . . . . . . 8 ⊢ (𝑥 = 𝑧 → (1st ‘𝑥) = (1st ‘𝑧)) | |
| 10 | vex 2824 | . . . . . . . . 9 ⊢ 𝑧 ∈ V | |
| 11 | 1stexg 6391 | . . . . . . . . 9 ⊢ (𝑧 ∈ V → (1st ‘𝑧) ∈ V) | |
| 12 | 10, 11 | ax-mp 5 | . . . . . . . 8 ⊢ (1st ‘𝑧) ∈ V |
| 13 | 9, 5, 12 | fvmpt 5776 | . . . . . . 7 ⊢ (𝑧 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = (1st ‘𝑧)) |
| 14 | 13 | eqeq1d 2247 | . . . . . 6 ⊢ (𝑧 ∈ 𝐴 → (((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = 𝑦 ↔ (1st ‘𝑧) = 𝑦)) |
| 15 | 14 | rexbiia 2565 | . . . . 5 ⊢ (∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = 𝑦 ↔ ∃𝑧 ∈ 𝐴 (1st ‘𝑧) = 𝑦) |
| 16 | 15 | a1i 9 | . . . 4 ⊢ (Rel 𝐴 → (∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = 𝑦 ↔ ∃𝑧 ∈ 𝐴 (1st ‘𝑧) = 𝑦)) |
| 17 | 8, 16 | bitr2id 193 | . . 3 ⊢ (Rel 𝐴 → (∃𝑧 ∈ 𝐴 (1st ‘𝑧) = 𝑦 ↔ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)))) |
| 18 | 1, 17 | bitrd 188 | . 2 ⊢ (Rel 𝐴 → (𝑦 ∈ dom 𝐴 ↔ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)))) |
| 19 | 18 | eqrdv 2236 | 1 ⊢ (Rel 𝐴 → dom 𝐴 = ran (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 Vcvv 2821 ↦ cmpt 4187 dom cdm 4769 ran crn 4770 Rel wrel 4774 Fn wfn 5367 ‘cfv 5372 1st c1st 6362 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-fo 5378 df-fv 5380 df-1st 6364 df-2nd 6365 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |