| 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 4134 analog.) (Contributed by NM, 7-Mar-2012.) |
| Ref | Expression |
|---|---|
| padd0.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| padd0.p | ⊢ + = (+𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| paddss12 | ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) → ((𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1210 | . . . . 5 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝐾 ∈ 𝐵) | |
| 2 | simpl2 1211 | . . . . 5 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑌 ⊆ 𝐴) | |
| 3 | sstr 3939 | . . . . . . . 8 ⊢ ((𝑍 ⊆ 𝑊 ∧ 𝑊 ⊆ 𝐴) → 𝑍 ⊆ 𝐴) | |
| 4 | 3 | ancoms 464 | . . . . . . 7 ⊢ ((𝑊 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝑊) → 𝑍 ⊆ 𝐴) |
| 5 | 4 | ad2ant2l 759 | . . . . . 6 ⊢ (((𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑍 ⊆ 𝐴) |
| 6 | 5 | 3adantl1 1185 | . . . . 5 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑍 ⊆ 𝐴) |
| 7 | 1, 2, 6 | 3jca 1146 | . . . 4 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) |
| 8 | simprl 783 | . . . 4 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑋 ⊆ 𝑌) | |
| 9 | padd0.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 10 | padd0.p | . . . . 5 ⊢ + = (+𝑃‘𝐾) | |
| 11 | 9, 10 | paddss1 40693 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴) → (𝑋 ⊆ 𝑌 → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑍))) |
| 12 | 7, 8, 11 | sylc 66 | . . 3 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑍)) |
| 13 | 9, 10 | paddss2 40694 | . . . . . 6 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑊 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑍 ⊆ 𝑊 → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| 14 | 13 | 3com23 1144 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) → (𝑍 ⊆ 𝑊 → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| 15 | 14 | imp 412 | . . . 4 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ 𝑍 ⊆ 𝑊) → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊)) |
| 16 | 15 | adantrl 729 | . . 3 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊)) |
| 17 | 12, 16 | sstrd 3941 | . 2 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑊)) |
| 18 | 17 | ex 418 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) → ((𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ‘cfv 6533 (class class class)co 7414 Atomscatm 40139 +𝑃cpadd 40671 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7987 df-2nd 7988 df-padd 40672 |
| This theorem is used by: paddssw1 40719 paddunN 40803 pl42lem2N 40856 |
| Copyright terms: Public domain | W3C validator |