| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > psssstr | Structured version Visualization version GIF version | ||
| Description: Transitive law for subclass and proper subclass. (Contributed by NM, 3-Apr-1996.) |
| Ref | Expression |
|---|---|
| psssstr | ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊊ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sspss 4056 | . 2 ⊢ (𝐵 ⊆ 𝐶 ↔ (𝐵 ⊊ 𝐶 ∨ 𝐵 = 𝐶)) | |
| 2 | psstr 4062 | . . . . 5 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) | |
| 3 | 2 | ex 417 | . . . 4 ⊢ (𝐴 ⊊ 𝐵 → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶)) |
| 4 | psseq2 4045 | . . . . 5 ⊢ (𝐵 = 𝐶 → (𝐴 ⊊ 𝐵 ↔ 𝐴 ⊊ 𝐶)) | |
| 5 | 4 | biimpcd 252 | . . . 4 ⊢ (𝐴 ⊊ 𝐵 → (𝐵 = 𝐶 → 𝐴 ⊊ 𝐶)) |
| 6 | 3, 5 | jaod 872 | . . 3 ⊢ (𝐴 ⊊ 𝐵 → ((𝐵 ⊊ 𝐶 ∨ 𝐵 = 𝐶) → 𝐴 ⊊ 𝐶)) |
| 7 | 6 | imp 411 | . 2 ⊢ ((𝐴 ⊊ 𝐵 ∧ (𝐵 ⊊ 𝐶 ∨ 𝐵 = 𝐶)) → 𝐴 ⊊ 𝐶) |
| 8 | 1, 7 | sylan2b 605 | 1 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊊ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1570 ⊆ wss 3905 ⊊ wpss 3906 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-ex 1810 df-cleq 2755 df-ne 2959 df-ss 3922 df-pss 3925 |
| This theorem is referenced by: psssstrd 4067 suplem1pr 11032 atexch 32733 bj-2upln0 37659 bj-2upln1upl 37660 |
| Copyright terms: Public domain | W3C validator |