Theorem trclublem 15044

Description: If a relation exists then the class of transitive relations which are supersets of that relation is not empty. (Contributed by RP, 28-Apr-2020.)

Assertion

Ref	Expression
trclublem	⊢ (𝑅 ∈ 𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)})

Distinct variable group:   𝑥,𝑅

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem trclublem

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		trclexlem 15043	. 2 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V)
2		ssun1 4201	. . 3 ⊢ 𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
3		relcnv 6134	. . . . . . . . . . . . . 14 ⊢ Rel ◡𝑅
4		relssdmrn 6299	. . . . . . . . . . . . . 14 ⊢ (Rel ◡𝑅 → ◡𝑅 ⊆ (dom ◡𝑅 × ran ◡𝑅))
5	3, 4	ax-mp 5	. . . . . . . . . . . . 13 ⊢ ◡𝑅 ⊆ (dom ◡𝑅 × ran ◡𝑅)
6		ssequn1 4209	. . . . . . . . . . . . 13 ⊢ (◡𝑅 ⊆ (dom ◡𝑅 × ran ◡𝑅) ↔ (◡𝑅 ∪ (dom ◡𝑅 × ran ◡𝑅)) = (dom ◡𝑅 × ran ◡𝑅))
7	5, 6	mpbi 230	. . . . . . . . . . . 12 ⊢ (◡𝑅 ∪ (dom ◡𝑅 × ran ◡𝑅)) = (dom ◡𝑅 × ran ◡𝑅)
8		cnvun 6174	. . . . . . . . . . . . 13 ⊢ ◡(𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (◡𝑅 ∪ ◡(dom 𝑅 × ran 𝑅))
9		cnvxp 6188	. . . . . . . . . . . . . . 15 ⊢ ◡(dom 𝑅 × ran 𝑅) = (ran 𝑅 × dom 𝑅)
10		df-rn 5711	. . . . . . . . . . . . . . . 16 ⊢ ran 𝑅 = dom ◡𝑅
11		dfdm4 5920	. . . . . . . . . . . . . . . 16 ⊢ dom 𝑅 = ran ◡𝑅
12	10, 11	xpeq12i 5728	. . . . . . . . . . . . . . 15 ⊢ (ran 𝑅 × dom 𝑅) = (dom ◡𝑅 × ran ◡𝑅)
13	9, 12	eqtri 2768	. . . . . . . . . . . . . 14 ⊢ ◡(dom 𝑅 × ran 𝑅) = (dom ◡𝑅 × ran ◡𝑅)
14	13	uneq2i 4188	. . . . . . . . . . . . 13 ⊢ (◡𝑅 ∪ ◡(dom 𝑅 × ran 𝑅)) = (◡𝑅 ∪ (dom ◡𝑅 × ran ◡𝑅))
15	8, 14	eqtri 2768	. . . . . . . . . . . 12 ⊢ ◡(𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (◡𝑅 ∪ (dom ◡𝑅 × ran ◡𝑅))
16	7, 15, 13	3eqtr4i 2778	. . . . . . . . . . 11 ⊢ ◡(𝑅 ∪ (dom 𝑅 × ran 𝑅)) = ◡(dom 𝑅 × ran 𝑅)
17	16	breqi 5172	. . . . . . . . . 10 ⊢ (𝑏◡(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑎 ↔ 𝑏◡(dom 𝑅 × ran 𝑅)𝑎)
18		vex 3492	. . . . . . . . . . 11 ⊢ 𝑏 ∈ V
19		vex 3492	. . . . . . . . . . 11 ⊢ 𝑎 ∈ V
20	18, 19	brcnv 5907	. . . . . . . . . 10 ⊢ (𝑏◡(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑎 ↔ 𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏)
21	18, 19	brcnv 5907	. . . . . . . . . 10 ⊢ (𝑏◡(dom 𝑅 × ran 𝑅)𝑎 ↔ 𝑎(dom 𝑅 × ran 𝑅)𝑏)
22	17, 20, 21	3bitr3i 301	. . . . . . . . 9 ⊢ (𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏 ↔ 𝑎(dom 𝑅 × ran 𝑅)𝑏)
23	16	breqi 5172	. . . . . . . . . 10 ⊢ (𝑐◡(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏 ↔ 𝑐◡(dom 𝑅 × ran 𝑅)𝑏)
24		vex 3492	. . . . . . . . . . 11 ⊢ 𝑐 ∈ V
25	24, 18	brcnv 5907	. . . . . . . . . 10 ⊢ (𝑐◡(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏 ↔ 𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)
26	24, 18	brcnv 5907	. . . . . . . . . 10 ⊢ (𝑐◡(dom 𝑅 × ran 𝑅)𝑏 ↔ 𝑏(dom 𝑅 × ran 𝑅)𝑐)
27	23, 25, 26	3bitr3i 301	. . . . . . . . 9 ⊢ (𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐 ↔ 𝑏(dom 𝑅 × ran 𝑅)𝑐)
28	22, 27	anbi12i 627	. . . . . . . 8 ⊢ ((𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏 ∧ 𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) ↔ (𝑎(dom 𝑅 × ran 𝑅)𝑏 ∧ 𝑏(dom 𝑅 × ran 𝑅)𝑐))
29	28	biimpi 216	. . . . . . 7 ⊢ ((𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏 ∧ 𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) → (𝑎(dom 𝑅 × ran 𝑅)𝑏 ∧ 𝑏(dom 𝑅 × ran 𝑅)𝑐))
30	29	eximi 1833	. . . . . 6 ⊢ (∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏 ∧ 𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐) → ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏 ∧ 𝑏(dom 𝑅 × ran 𝑅)𝑐))
31	30	ssopab2i 5569	. . . . 5 ⊢ {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏 ∧ 𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)} ⊆ {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏 ∧ 𝑏(dom 𝑅 × ran 𝑅)𝑐)}
32		df-co 5709	. . . . 5 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) = {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑏 ∧ 𝑏(𝑅 ∪ (dom 𝑅 × ran 𝑅))𝑐)}
33		df-co 5709	. . . . 5 ⊢ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) = {⟨𝑎, 𝑐⟩ ∣ ∃𝑏(𝑎(dom 𝑅 × ran 𝑅)𝑏 ∧ 𝑏(dom 𝑅 × ran 𝑅)𝑐)}
34	31, 32, 33	3sstr4i 4052	. . . 4 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅))
35		xptrrel 15029	. . . . 5 ⊢ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (dom 𝑅 × ran 𝑅)
36		ssun2 4202	. . . . 5 ⊢ (dom 𝑅 × ran 𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
37	35, 36	sstri 4018	. . . 4 ⊢ ((dom 𝑅 × ran 𝑅) ∘ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
38	34, 37	sstri 4018	. . 3 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
39		trcleq2lem 15040	. . . . 5 ⊢ (𝑥 = (𝑅 ∪ (dom 𝑅 × ran 𝑅)) → ((𝑅 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥) ↔ (𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))))
40	39	elabg 3690	. . . 4 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ↔ (𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))))
41	40	biimprd 248	. . 3 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → ((𝑅 ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∧ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∘ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)}))
42	2, 38, 41	mp2ani 697	. 2 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)})
43	1, 42	syl 17	1 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑥 ∣ (𝑅 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108  {cab 2717  Vcvv 3488   ∪ cun 3974   ⊆ wss 3976   class class class wbr 5166  {copab 5228   × cxp 5698  ^◡ccnv 5699  dom cdm 5700  ran crn 5701   ∘ ccom 5704  Rel wrel 5705

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712

This theorem is referenced by:  trclubi  15045  trclubgi  15046  trclub  15047  trclubg  15048