Metamath Proof Explorer


Theorem trclubi

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)

Ref Expression
Hypotheses trclubi.rel ⊢ Rel ⁡ R
trclubi.rex ⊢ R ∈ V
Assertion trclubi ⊢ ⋂ s | R ⊆ s ∧ s ∘ s ⊆ s ⊆ dom ⁡ R × ran ⁡ R

Proof

Step Hyp Ref Expression
1 trclubi.rel ⊢ Rel ⁡ R
2 trclubi.rex ⊢ R ∈ V
3 relssdmrn ⊢ Rel ⁡ R → R ⊆ dom ⁡ R × ran ⁡ R
4 ssequn1 ⊢ R ⊆ dom ⁡ R × ran ⁡ R ↔ R ∪ dom ⁡ R × ran ⁡ R = dom ⁡ R × ran ⁡ R
5 3 4 sylib ⊢ Rel ⁡ R → R ∪ dom ⁡ R × ran ⁡ R = dom ⁡ R × ran ⁡ R
6 1 5 ax-mp ⊢ R ∪ dom ⁡ R × ran ⁡ R = dom ⁡ R × ran ⁡ R
7 trclublem ⊢ R ∈ V → R ∪ dom ⁡ R × ran ⁡ R ∈ s | R ⊆ s ∧ s ∘ s ⊆ s
8 2 7 ax-mp ⊢ R ∪ dom ⁡ R × ran ⁡ R ∈ s | R ⊆ s ∧ s ∘ s ⊆ s
9 6 8 eqeltrri ⊢ dom ⁡ R × ran ⁡ R ∈ s | R ⊆ s ∧ s ∘ s ⊆ s
10 intss1 ⊢ dom ⁡ R × ran ⁡ R ∈ s | R ⊆ s ∧ s ∘ s ⊆ s → ⋂ s | R ⊆ s ∧ s ∘ s ⊆ s ⊆ dom ⁡ R × ran ⁡ R
11 9 10 ax-mp ⊢ ⋂ s | R ⊆ s ∧ s ∘ s ⊆ s ⊆ dom ⁡ R × ran ⁡ R