| 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 6379 | . . 3 ⊢ (Rel 𝐴 → (𝑦 ∈ dom 𝐴 ↔ ∃𝑧 ∈ 𝐴 (1st ‘𝑧) = 𝑦)) | |
| 2 | vex 2816 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 3 | 1stexg 6361 | . . . . . . 7 ⊢ (𝑥 ∈ V → (1st ‘𝑥) ∈ V) | |
| 4 | 2, 3 | ax-mp 5 | . . . . . 6 ⊢ (1st ‘𝑥) ∈ V |
| 5 | eqid 2232 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) | |
| 6 | 4, 5 | fnmpti 5487 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) Fn 𝐴 |
| 7 | fvelrnb 5724 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) Fn 𝐴 → (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) ↔ ∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = 𝑦)) | |
| 8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥)) ↔ ∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = 𝑦) |
| 9 | fveq2 5670 | . . . . . . . 8 ⊢ (𝑥 = 𝑧 → (1st ‘𝑥) = (1st ‘𝑧)) | |
| 10 | vex 2816 | . . . . . . . . 9 ⊢ 𝑧 ∈ V | |
| 11 | 1stexg 6361 | . . . . . . . . 9 ⊢ (𝑧 ∈ V → (1st ‘𝑧) ∈ V) | |
| 12 | 10, 11 | ax-mp 5 | . . . . . . . 8 ⊢ (1st ‘𝑧) ∈ V |
| 13 | 9, 5, 12 | fvmpt 5754 | . . . . . . 7 ⊢ (𝑧 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = (1st ‘𝑧)) |
| 14 | 13 | eqeq1d 2241 | . . . . . 6 ⊢ (𝑧 ∈ 𝐴 → (((𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))‘𝑧) = 𝑦 ↔ (1st ‘𝑧) = 𝑦)) |
| 15 | 14 | rexbiia 2557 | . . . . 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 2230 | 1 ⊢ (Rel 𝐴 → dom 𝐴 = ran (𝑥 ∈ 𝐴 ↦ (1st ‘𝑥))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∈ wcel 2203 ∃wrex 2521 Vcvv 2813 ↦ cmpt 4171 dom cdm 4749 ran crn 4750 Rel wrel 4754 Fn wfn 5347 ‘cfv 5352 1st c1st 6332 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-v 2815 df-sbc 3043 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-fo 5358 df-fv 5360 df-1st 6334 df-2nd 6335 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |