| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trclsslem | Structured version Visualization version GIF version | ||
| Description: The transitive closure (as a relation) of a subclass is a subclass of the transitive closure. (Contributed by RP, 3-May-2020.) |
| Ref | Expression |
|---|---|
| trclsslem | ⊢ (𝑅 ⊆ 𝑆 → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)} ⊆ ∩ {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clsslem 14997 | 1 ⊢ (𝑅 ⊆ 𝑆 → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)} ⊆ ∩ {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 {cab 2740 ⊆ wss 3904 ∩ cint 4905 ∘ ccom 5651 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-ral 3077 df-ss 3921 df-int 4906 |
| This theorem is referenced by: trclfvss 15019 |
| Copyright terms: Public domain | W3C validator |