Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > trclfvlb3 | Structured version Visualization version GIF version |
Description: The transitive closure of a relation has a lower bound. (Contributed by RP, 8-May-2020.) |
Ref | Expression |
---|---|
trclfvlb3 | ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ (t+‘𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | trclfvlb 14370 | . 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ⊆ (t+‘𝑅)) | |
2 | trclfvlb2 14372 | . 2 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∘ 𝑅) ⊆ (t+‘𝑅)) | |
3 | 1, 2 | unssd 4164 | 1 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ (t+‘𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2114 ∪ cun 3936 ⊆ wss 3938 ∘ ccom 5561 ‘cfv 6357 t+ctcl 14347 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-int 4879 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-iota 6316 df-fun 6359 df-fv 6365 df-trcl 14349 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |