reldm - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > reldm		Structured version Visualization version GIF version

Theorem reldm 7988

Description: An expression for the domain of a relation. (Contributed by NM, 22-Sep-2013.)

**Assertion**
Ref	Expression
reldm	⊢ (Rel 𝐴 → dom 𝐴 = ran (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)))

Distinct variable group: 𝑥,𝐴

Proof of Theorem reldm Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		releldm2 7987	. . 3 ⊢ (Rel 𝐴 → (𝑦 ∈ dom 𝐴 ↔ ∃𝑧 ∈ 𝐴 (1^st ‘𝑧) = 𝑦))
2		fvex 6847	. . . . . 6 ⊢ (1^st ‘𝑥) ∈ V
3		eqid 2736	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))
4	2, 3	fnmpti 6635	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) Fn 𝐴
5		fvelrnb 6894	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) Fn 𝐴 → (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) ↔ ∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = 𝑦))
6	4, 5	ax-mp 5	. . . 4 ⊢ (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) ↔ ∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = 𝑦)
7		fveq2 6834	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (1^st ‘𝑥) = (1^st ‘𝑧))
8		fvex 6847	. . . . . . . 8 ⊢ (1^st ‘𝑧) ∈ V
9	7, 3, 8	fvmpt 6941	. . . . . . 7 ⊢ (𝑧 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = (1^st ‘𝑧))
10	9	eqeq1d 2738	. . . . . 6 ⊢ (𝑧 ∈ 𝐴 → (((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = 𝑦 ↔ (1^st ‘𝑧) = 𝑦))
11	10	rexbiia 3081	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = 𝑦 ↔ ∃𝑧 ∈ 𝐴 (1^st ‘𝑧) = 𝑦)
12	11	a1i 11	. . . 4 ⊢ (Rel 𝐴 → (∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = 𝑦 ↔ ∃𝑧 ∈ 𝐴 (1^st ‘𝑧) = 𝑦))
13	6, 12	bitr2id 284	. . 3 ⊢ (Rel 𝐴 → (∃𝑧 ∈ 𝐴 (1^st ‘𝑧) = 𝑦 ↔ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))))
14	1, 13	bitrd 279	. 2 ⊢ (Rel 𝐴 → (𝑦 ∈ dom 𝐴 ↔ 𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))))
15	14	eqrdv 2734	1 ⊢ (Rel 𝐴 → dom 𝐴 = ran (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2113 ∃wrex 3060 ↦ cmpt 5179 dom cdm 5624 ran crn 5625 Rel wrel 5629 Fn wfn 6487 ‘cfv 6492 1^st c1st 7931

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6448 df-fun 6494 df-fn 6495 df-fv 6500 df-1st 7933 df-2nd 7934

This theorem is referenced by: fidomdm 9234 dmct 10434

W3C validator