| 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 15008 | 1 ⊢ (𝑅 ⊆ 𝑆 → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)} ⊆ ∩ {𝑟 ∣ (𝑆 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 {cab 2714 ⊆ wss 3931 ∩ cint 4927 ∘ ccom 5663 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-9 2119 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 df-sb 2066 df-clab 2715 df-cleq 2728 df-ral 3053 df-ss 3948 df-int 4928 |
| This theorem is referenced by: trclfvss 15030 |
| Copyright terms: Public domain | W3C validator |