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 4078 | . 2 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵)) | |
2 | psstr 4083 | . . . . 5 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) | |
3 | 2 | ex 415 | . . . 4 ⊢ (𝐴 ⊊ 𝐵 → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶)) |
4 | psseq1 4066 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝐴 ⊊ 𝐶 ↔ 𝐵 ⊊ 𝐶)) | |
5 | 4 | biimprd 250 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶)) |
6 | 3, 5 | jaoi 853 | . . 3 ⊢ ((𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵) → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶)) |
7 | 6 | imp 409 | . 2 ⊢ (((𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵) ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) |
8 | 1, 7 | sylanb 583 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∨ wo 843 = wceq 1537 ⊆ wss 3938 ⊊ wpss 3939 |
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 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-ne 3019 df-in 3945 df-ss 3954 df-pss 3956 |
This theorem is referenced by: sspsstrd 4087 ordtr2 6237 php 8703 canthp1lem2 10077 suplem1pr 10476 fbfinnfr 22451 ppiltx 25756 |
Copyright terms: Public domain | W3C validator |