Theorem trrelsuperrel2dg 44511

Description: Concrete construction of a superclass of relation 𝑅 which is a transitive relation. (Contributed by RP, 20-Jul-2020.)

Hypothesis

Ref	Expression
trrelsuperrel2dg.s	⊢ (𝜑 → 𝑆 = (𝑅 ∪ (dom 𝑅 × ran 𝑅)))

Assertion

Ref	Expression
trrelsuperrel2dg	⊢ (𝜑 → (𝑅 ⊆ 𝑆 ∧ (𝑆 ∘ 𝑆) ⊆ 𝑆))

Proof of Theorem trrelsuperrel2dg

Step	Hyp	Ref	Expression
1		ssun1 4124	. . 3 ⊢ 𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
2		trrelsuperrel2dg.s	. . 3 ⊢ (𝜑 → 𝑆 = (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
3	1, 2	sseqtrrid 3974	. 2 ⊢ (𝜑 → 𝑅 ⊆ 𝑆)
4		xptrrel 15053	. . . . 5 ⊢ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (dom 𝑅 × ran 𝑅)
5		ssun2 4125	. . . . 5 ⊢ (dom 𝑅 × ran 𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
6	4, 5	sstri 3940	. . . 4 ⊢ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
7	6	a1i 11	. . 3 ⊢ (𝜑 → ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
8	2, 2	coeq12d 5844	. . . 4 ⊢ (𝜑 → (𝑆 ∘ 𝑆) = ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
9		coundir 6244	. . . . . 6 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ∪ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
10		relcnv 6100	. . . . . . 7 ⊢ Rel ◡◡𝑅
11		cocnvcnv1 6254	. . . . . . . . 9 ⊢ (◡◡𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = (𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
12		relssdmrn 6266	. . . . . . . . . . 11 ⊢ (Rel ◡◡𝑅 → ◡◡𝑅 ⊆ (dom ◡◡𝑅 × ran ◡◡𝑅))
13		dmcnvcnv 5917	. . . . . . . . . . . 12 ⊢ dom ◡◡𝑅 = dom 𝑅
14		rncnvcnv 5918	. . . . . . . . . . . 12 ⊢ ran ◡◡𝑅 = ran 𝑅
15	13, 14	xpeq12i 5683	. . . . . . . . . . 11 ⊢ (dom ◡◡𝑅 × ran ◡◡𝑅) = (dom 𝑅 × ran 𝑅)
16	12, 15	sseqtrdi 3971	. . . . . . . . . 10 ⊢ (Rel ◡◡𝑅 → ◡◡𝑅 ⊆ (dom 𝑅 × ran 𝑅))
17		coss1 5835	. . . . . . . . . 10 ⊢ (◡◡𝑅 ⊆ (dom 𝑅 × ran 𝑅) → (◡◡𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
18	16, 17	syl 18	. . . . . . . . 9 ⊢ (Rel ◡◡𝑅 → (◡◡𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
19	11, 18	eqsstrrid 3970	. . . . . . . 8 ⊢ (Rel ◡◡𝑅 → (𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
20		ssequn1 4132	. . . . . . . 8 ⊢ ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ↔ ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ∪ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))) = ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
21	19, 20	sylib 221	. . . . . . 7 ⊢ (Rel ◡◡𝑅 → ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ∪ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))) = ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))))
22	10, 21	ax-mp 5	. . . . . 6 ⊢ ((𝑅 ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ∪ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))) = ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
23	9, 22	eqtri 2783	. . . . 5 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
24		coundi 6243	. . . . . 6 ⊢ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ∪ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
25		cocnvcnv2 6255	. . . . . . . . 9 ⊢ ((dom 𝑅 × ran 𝑅) ∘ ◡◡𝑅) = ((dom 𝑅 × ran 𝑅) ∘ 𝑅)
26		coss2 5836	. . . . . . . . . 10 ⊢ (◡◡𝑅 ⊆ (dom 𝑅 × ran 𝑅) → ((dom 𝑅 × ran 𝑅) ∘ ◡◡𝑅) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
27	16, 26	syl 18	. . . . . . . . 9 ⊢ (Rel ◡◡𝑅 → ((dom 𝑅 × ran 𝑅) ∘ ◡◡𝑅) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
28	25, 27	eqsstrrid 3970	. . . . . . . 8 ⊢ (Rel ◡◡𝑅 → ((dom 𝑅 × ran 𝑅) ∘ 𝑅) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
29		ssequn1 4132	. . . . . . . 8 ⊢ (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ↔ (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ∪ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
30	28, 29	sylib 221	. . . . . . 7 ⊢ (Rel ◡◡𝑅 → (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ∪ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
31	10, 30	ax-mp 5	. . . . . 6 ⊢ (((dom 𝑅 × ran 𝑅) ∘ 𝑅) ∪ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
32	24, 31	eqtri 2783	. . . . 5 ⊢ ((dom 𝑅 × ran 𝑅) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
33	23, 32	eqtri 2783	. . . 4 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
34	8, 33	eqtrdi 2811	. . 3 ⊢ (𝜑 → (𝑆 ∘ 𝑆) = ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)))
35	7, 34, 2	3sstr4d 3986	. 2 ⊢ (𝜑 → (𝑆 ∘ 𝑆) ⊆ 𝑆)
36	3, 35	jca 521	1 ⊢ (𝜑 → (𝑅 ⊆ 𝑆 ∧ (𝑆 ∘ 𝑆) ⊆ 𝑆))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∪ cun 3897   ⊆ wss 3899   × cxp 5653  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   ∘ ccom 5659  Rel wrel 5660

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667

This theorem is used by: (None)