Theorem trclubi 15040

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

This proof depends on syntax axioms:   ∧ wa 400   = wceq 1569   ∈ wcel 2142  {cab 2740  Vcvv 3454   ∪ cun 3902   ⊆ wss 3904  ∩ cint 4911   × cxp 5658  dom cdm 5660  ran crn 5661   ∘ ccom 5664  Rel wrel 5665

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-11 2191  ax-ext 2734  ax-sep 5256  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-br 5109  df-opab 5173  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672

This theorem is used by: (None)