| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > paddss12 | Structured version Visualization version GIF version | ||
| Description: Subset law for projective subspace sum. (unss12 4141 analog.) (Contributed by NM, 7-Mar-2012.) |
| Ref | Expression |
|---|---|
| padd0.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| padd0.p | ⊢ + = (+𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| paddss12 | ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) → ((𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1206 | . . . . 5 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝐾 ∈ 𝐵) | |
| 2 | simpl2 1207 | . . . . 5 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑌 ⊆ 𝐴) | |
| 3 | sstr 3945 | . . . . . . . 8 ⊢ ((𝑍 ⊆ 𝑊 ∧ 𝑊 ⊆ 𝐴) → 𝑍 ⊆ 𝐴) | |
| 4 | 3 | ancoms 462 | . . . . . . 7 ⊢ ((𝑊 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝑊) → 𝑍 ⊆ 𝐴) |
| 5 | 4 | ad2ant2l 756 | . . . . . 6 ⊢ (((𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑍 ⊆ 𝐴) |
| 6 | 5 | 3adantl1 1181 | . . . . 5 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑍 ⊆ 𝐴) |
| 7 | 1, 2, 6 | 3jca 1142 | . . . 4 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) |
| 8 | simprl 780 | . . . 4 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑋 ⊆ 𝑌) | |
| 9 | padd0.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 10 | padd0.p | . . . . 5 ⊢ + = (+𝑃‘𝐾) | |
| 11 | 9, 10 | paddss1 40442 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴) → (𝑋 ⊆ 𝑌 → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑍))) |
| 12 | 7, 8, 11 | sylc 65 | . . 3 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑍)) |
| 13 | 9, 10 | paddss2 40443 | . . . . . 6 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑊 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑍 ⊆ 𝑊 → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| 14 | 13 | 3com23 1140 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) → (𝑍 ⊆ 𝑊 → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| 15 | 14 | imp 410 | . . . 4 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ 𝑍 ⊆ 𝑊) → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊)) |
| 16 | 15 | adantrl 726 | . . 3 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊)) |
| 17 | 12, 16 | sstrd 3947 | . 2 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑊)) |
| 18 | 17 | ex 416 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) → ((𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 ⊆ wss 3905 ‘cfv 6522 (class class class)co 7397 Atomscatm 39888 +𝑃cpadd 40420 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3078 df-rex 3088 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-id 5543 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-ov 7400 df-oprab 7401 df-mpo 7402 df-1st 7971 df-2nd 7972 df-padd 40421 |
| This theorem is referenced by: paddssw1 40468 paddunN 40552 pl42lem2N 40605 |
| Copyright terms: Public domain | W3C validator |