| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sspsstr | Structured version Visualization version GIF version | ||
| Description: Transitive law for subclass and proper subclass. (Contributed by NM, 3-Apr-1996.) |
| Ref | Expression |
|---|---|
| sspsstr | ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sspss 4029 | . 2 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵)) | |
| 2 | psstr 4035 | . . . . 5 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) | |
| 3 | 2 | ex 418 | . . . 4 ⊢ (𝐴 ⊊ 𝐵 → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶)) |
| 4 | psseq1 4017 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝐴 ⊊ 𝐶 ↔ 𝐵 ⊊ 𝐶)) | |
| 5 | 4 | biimprd 251 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶)) |
| 6 | 3, 5 | jaoi 871 | . . 3 ⊢ ((𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵) → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶)) |
| 7 | 6 | imp 412 | . 2 ⊢ (((𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵) ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) |
| 8 | 1, 7 | sylanb 593 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1569 ⊆ wss 3895 ⊊ wpss 4013 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ex 1812 df-cleq 2752 df-ne 2956 df-ss 3896 df-pss 4014 |
| This theorem is used by: sspsstrd 4039 ordtr2 6408 php 9226 canthp1lem2 10742 suplem1pr 11141 fbfinnfr 24166 ppiltx 27510 |
| Copyright terms: Public domain | W3C validator |