![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > sstr | GIF version |
Description: Transitivity of subclasses. Theorem 6 of [Suppes] p. 23. (Contributed by NM, 5-Sep-2003.) |
Ref | Expression |
---|---|
sstr | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sstr2 3109 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐵 ⊆ 𝐶 → 𝐴 ⊆ 𝐶)) | |
2 | 1 | imp 123 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ⊆ wss 3076 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-11 1485 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-in 3082 df-ss 3089 |
This theorem is referenced by: sstrd 3112 sylan9ss 3115 ssdifss 3211 uneqin 3332 ssindif0im 3427 undifss 3448 ssrnres 4989 relrelss 5073 fco 5296 fssres 5306 ssimaex 5490 tpostpos2 6170 smores 6197 pmss12g 6577 fidcenumlemr 6851 iccsupr 9779 fimaxq 10605 fsum2d 11236 fsumabs 11266 tgval 12257 tgvalex 12258 ssnei 12359 opnneiss 12366 restdis 12392 tgcnp 12417 blssexps 12637 blssex 12638 mopni3 12692 metss 12702 metcnp3 12719 tgioo 12754 cncfmptid 12791 |
Copyright terms: Public domain | W3C validator |