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 7998

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 7997	. . 3 ⊢ (Rel 𝐴 → (𝑦 ∈ dom 𝐴 ↔ ∃𝑧 ∈ 𝐴 (1^st ‘𝑧) = 𝑦))
2		fvex 6855	. . . . . 6 ⊢ (1^st ‘𝑥) ∈ V
3		eqid 2737	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))
4	2, 3	fnmpti 6643	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) Fn 𝐴
5		fvelrnb 6902	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) Fn 𝐴 → (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) ↔ ∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = 𝑦))
6	4, 5	ax-mp 5	. . . 4 ⊢ (𝑦 ∈ ran (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)) ↔ ∃𝑧 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = 𝑦)
7		fveq2 6842	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (1^st ‘𝑥) = (1^st ‘𝑧))
8		fvex 6855	. . . . . . . 8 ⊢ (1^st ‘𝑧) ∈ V
9	7, 3, 8	fvmpt 6949	. . . . . . 7 ⊢ (𝑧 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = (1^st ‘𝑧))
10	9	eqeq1d 2739	. . . . . 6 ⊢ (𝑧 ∈ 𝐴 → (((𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥))‘𝑧) = 𝑦 ↔ (1^st ‘𝑧) = 𝑦))
11	10	rexbiia 3083	. . . . 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 2735	1 ⊢ (Rel 𝐴 → dom 𝐴 = ran (𝑥 ∈ 𝐴 ↦ (1^st ‘𝑥)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 ∃wrex 3062 ↦ cmpt 5181 dom cdm 5632 ran crn 5633 Rel wrel 5637 Fn wfn 6495 ‘cfv 6500 1^st c1st 7941

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 ax-un 7690

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-iota 6456 df-fun 6502 df-fn 6503 df-fv 6508 df-1st 7943 df-2nd 7944

This theorem is referenced by: fidomdm 9246 dmct 10446

W3C validator