Theorem trclubi 15018

Description: The Cartesian product of the domain and range of a relation is an upper bound for its transitive closure. (Contributed by RP, 2-Jan-2020.) (Revised by RP, 28-Apr-2020.) (Revised by AV, 26-Mar-2021.)

Hypotheses

Ref	Expression
trclubi.rel	⊢ Rel 𝑅
trclubi.rex	⊢ 𝑅 ∈ V

Assertion

Ref	Expression
trclubi	⊢ ∩ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅)

Distinct variable group:   𝑅,𝑠

Proof of Theorem trclubi

Step	Hyp	Ref	Expression
1		trclubi.rel	. . . 4 ⊢ Rel 𝑅
2		relssdmrn 6270	. . . . 5 ⊢ (Rel 𝑅 → 𝑅 ⊆ (dom 𝑅 × ran 𝑅))
3		ssequn1 4168	. . . . 5 ⊢ (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
4	2, 3	sylib 218	. . . 4 ⊢ (Rel 𝑅 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
5	1, 4	ax-mp 5	. . 3 ⊢ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
6		trclubi.rex	. . . 4 ⊢ 𝑅 ∈ V
7		trclublem 15017	. . . 4 ⊢ (𝑅 ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)})
8	6, 7	ax-mp 5	. . 3 ⊢ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)}
9	5, 8	eqeltrri 2830	. 2 ⊢ (dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)}
10		intss1 4945	. 2 ⊢ ((dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} → ∩ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅))
11	9, 10	ax-mp 5	1 ⊢ ∩ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅)

Syntax hints:   ∧ wa 395   = wceq 1539   ∈ wcel 2107  {cab 2712  Vcvv 3464   ∪ cun 3931   ⊆ wss 3933  ∩ cint 4928   × cxp 5665  dom cdm 5667  ran crn 5668   ∘ ccom 5671  Rel wrel 5672

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-sep 5278  ax-nul 5288  ax-pow 5347  ax-pr 5414  ax-un 7738

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3421  df-v 3466  df-dif 3936  df-un 3938  df-in 3940  df-ss 3950  df-nul 4316  df-if 4508  df-pw 4584  df-sn 4609  df-pr 4611  df-op 4615  df-uni 4890  df-int 4929  df-br 5126  df-opab 5188  df-xp 5673  df-rel 5674  df-cnv 5675  df-co 5676  df-dm 5677  df-rn 5678  df-res 5679

This theorem is referenced by: (None)