Metamath Proof Explorer


Theorem trclfvlb2

Description: The transitive closure of a relation has a lower bound. (Contributed by RP, 8-May-2020)

Ref Expression
Assertion trclfvlb2 ⊢ R ∈ V → R ∘ R ⊆ t+ ⁡ R

Proof

Step Hyp Ref Expression
1 trclfvcotr ⊢ R ∈ V → t+ ⁡ R ∘ t+ ⁡ R ⊆ t+ ⁡ R
2 trclfvlb ⊢ R ∈ V → R ⊆ t+ ⁡ R
3 1 2 2 trrelssd ⊢ R ∈ V → R ∘ R ⊆ t+ ⁡ R