Metamath Proof Explorer


Theorem trclfvlb

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

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

Proof

Step Hyp Ref Expression
1 ssmin ⊢ R ⊆ ⋂ r | R ⊆ r ∧ r ∘ r ⊆ r
2 trclfv ⊢ R ∈ V → t+ ⁡ R = ⋂ r | R ⊆ r ∧ r ∘ r ⊆ r
3 1 2 sseqtrrid ⊢ R ∈ V → R ⊆ t+ ⁡ R