Theorem dmtrclfv 14369

Description: The domain of the transitive closure is equal to the domain of the relation. (Contributed by RP, 9-May-2020.)

Assertion

Ref	Expression
dmtrclfv	⊢ (𝑅 ∈ 𝑉 → dom (t+‘𝑅) = dom 𝑅)

Proof of Theorem dmtrclfv

Step	Hyp	Ref	Expression
1		trclfvub 14358	. . . 4 ⊢ (𝑅 ∈ 𝑉 → (t+‘𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
2		dmss 5735	. . . 4 ⊢ ((t+‘𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) → dom (t+‘𝑅) ⊆ dom (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
3	1, 2	syl 17	. . 3 ⊢ (𝑅 ∈ 𝑉 → dom (t+‘𝑅) ⊆ dom (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
4		dmun 5743	. . . 4 ⊢ dom (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 ∪ dom (dom 𝑅 × ran 𝑅))
5		dm0rn0 5759	. . . . . . 7 ⊢ (dom 𝑅 = ∅ ↔ ran 𝑅 = ∅)
6		xpeq1 5533	. . . . . . . . . 10 ⊢ (dom 𝑅 = ∅ → (dom 𝑅 × ran 𝑅) = (∅ × ran 𝑅))
7		0xp 5613	. . . . . . . . . 10 ⊢ (∅ × ran 𝑅) = ∅
8	6, 7	eqtrdi 2849	. . . . . . . . 9 ⊢ (dom 𝑅 = ∅ → (dom 𝑅 × ran 𝑅) = ∅)
9	8	dmeqd 5738	. . . . . . . 8 ⊢ (dom 𝑅 = ∅ → dom (dom 𝑅 × ran 𝑅) = dom ∅)
10		dm0 5754	. . . . . . . . 9 ⊢ dom ∅ = ∅
11	10	a1i 11	. . . . . . . 8 ⊢ (dom 𝑅 = ∅ → dom ∅ = ∅)
12		eqcom 2805	. . . . . . . . 9 ⊢ (dom 𝑅 = ∅ ↔ ∅ = dom 𝑅)
13	12	biimpi 219	. . . . . . . 8 ⊢ (dom 𝑅 = ∅ → ∅ = dom 𝑅)
14	9, 11, 13	3eqtrd 2837	. . . . . . 7 ⊢ (dom 𝑅 = ∅ → dom (dom 𝑅 × ran 𝑅) = dom 𝑅)
15	5, 14	sylbir 238	. . . . . 6 ⊢ (ran 𝑅 = ∅ → dom (dom 𝑅 × ran 𝑅) = dom 𝑅)
16		dmxp 5763	. . . . . 6 ⊢ (ran 𝑅 ≠ ∅ → dom (dom 𝑅 × ran 𝑅) = dom 𝑅)
17	15, 16	pm2.61ine 3070	. . . . 5 ⊢ dom (dom 𝑅 × ran 𝑅) = dom 𝑅
18	17	uneq2i 4087	. . . 4 ⊢ (dom 𝑅 ∪ dom (dom 𝑅 × ran 𝑅)) = (dom 𝑅 ∪ dom 𝑅)
19		unidm 4079	. . . 4 ⊢ (dom 𝑅 ∪ dom 𝑅) = dom 𝑅
20	4, 18, 19	3eqtri 2825	. . 3 ⊢ dom (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = dom 𝑅
21	3, 20	sseqtrdi 3965	. 2 ⊢ (𝑅 ∈ 𝑉 → dom (t+‘𝑅) ⊆ dom 𝑅)
22		trclfvlb 14359	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ⊆ (t+‘𝑅))
23		dmss 5735	. . 3 ⊢ (𝑅 ⊆ (t+‘𝑅) → dom 𝑅 ⊆ dom (t+‘𝑅))
24	22, 23	syl 17	. 2 ⊢ (𝑅 ∈ 𝑉 → dom 𝑅 ⊆ dom (t+‘𝑅))
25	21, 24	eqssd 3932	1 ⊢ (𝑅 ∈ 𝑉 → dom (t+‘𝑅) = dom 𝑅)

Syntax hints:   → wi 4   = wceq 1538   ∈ wcel 2111   ∪ cun 3879   ⊆ wss 3881  ∅c0 4243   × cxp 5517  dom cdm 5519  ran crn 5520  ‘cfv 6324  t+ctcl 14336

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-int 4839  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-iota 6283  df-fun 6326  df-fv 6332  df-trcl 14338

This theorem is referenced by:  rntrclfvRP  40432