Theorem trclubi 14707

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 6172	. . . . 5 ⊢ (Rel 𝑅 → 𝑅 ⊆ (dom 𝑅 × ran 𝑅))
3		ssequn1 4114	. . . . 5 ⊢ (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
4	2, 3	sylib 217	. . . 4 ⊢ (Rel 𝑅 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
5	1, 4	ax-mp 5	. . 3 ⊢ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
6		trclubi.rex	. . . 4 ⊢ 𝑅 ∈ V
7		trclublem 14706	. . . 4 ⊢ (𝑅 ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)})
8	6, 7	ax-mp 5	. . 3 ⊢ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)}
9	5, 8	eqeltrri 2836	. 2 ⊢ (dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)}
10		intss1 4894	. 2 ⊢ ((dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} → ∩ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅))
11	9, 10	ax-mp 5	1 ⊢ ∩ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅)

Syntax hints:   ∧ wa 396   = wceq 1539   ∈ wcel 2106  {cab 2715  Vcvv 3432   ∪ cun 3885   ⊆ wss 3887  ∩ cint 4879   × cxp 5587  dom cdm 5589  ran crn 5590   ∘ ccom 5593  Rel wrel 5594

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601

This theorem is referenced by: (None)