Metamath Proof Explorer


Theorem trclfvub

Description: The transitive closure of a relation has an upper bound. (Contributed by RP, 28-Apr-2020)

Ref Expression
Assertion trclfvub ⊢ R ∈ V → t+ ⁡ R ⊆ R ∪ dom ⁡ R × ran ⁡ R

Proof

Step Hyp Ref Expression
1 trclfv ⊢ R ∈ V → t+ ⁡ R = ⋂ r | R ⊆ r ∧ r ∘ r ⊆ r
2 trclubg ⊢ R ∈ V → ⋂ r | R ⊆ r ∧ r ∘ r ⊆ r ⊆ R ∪ dom ⁡ R × ran ⁡ R
3 1 2 eqsstrd ⊢ R ∈ V → t+ ⁡ R ⊆ R ∪ dom ⁡ R × ran ⁡ R