| 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 4142 analog.) (Contributed by NM, 7-Mar-2012.) |
| Ref | Expression |
|---|---|
| padd0.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| padd0.p | ⊢ + = (+𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| paddss12 | ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) → ((𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1193 | . . . . 5 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝐾 ∈ 𝐵) | |
| 2 | simpl2 1194 | . . . . 5 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑌 ⊆ 𝐴) | |
| 3 | sstr 3944 | . . . . . . . 8 ⊢ ((𝑍 ⊆ 𝑊 ∧ 𝑊 ⊆ 𝐴) → 𝑍 ⊆ 𝐴) | |
| 4 | 3 | ancoms 458 | . . . . . . 7 ⊢ ((𝑊 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝑊) → 𝑍 ⊆ 𝐴) |
| 5 | 4 | ad2ant2l 747 | . . . . . 6 ⊢ (((𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑍 ⊆ 𝐴) |
| 6 | 5 | 3adantl1 1168 | . . . . 5 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑍 ⊆ 𝐴) |
| 7 | 1, 2, 6 | 3jca 1129 | . . . 4 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) |
| 8 | simprl 771 | . . . 4 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → 𝑋 ⊆ 𝑌) | |
| 9 | padd0.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 10 | padd0.p | . . . . 5 ⊢ + = (+𝑃‘𝐾) | |
| 11 | 9, 10 | paddss1 40222 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴) → (𝑋 ⊆ 𝑌 → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑍))) |
| 12 | 7, 8, 11 | sylc 65 | . . 3 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑍)) |
| 13 | 9, 10 | paddss2 40223 | . . . . . 6 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑊 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑍 ⊆ 𝑊 → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| 14 | 13 | 3com23 1127 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) → (𝑍 ⊆ 𝑊 → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| 15 | 14 | imp 406 | . . . 4 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ 𝑍 ⊆ 𝑊) → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊)) |
| 16 | 15 | adantrl 717 | . . 3 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝑌 + 𝑍) ⊆ (𝑌 + 𝑊)) |
| 17 | 12, 16 | sstrd 3946 | . 2 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) ∧ (𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊)) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑊)) |
| 18 | 17 | ex 412 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑊 ⊆ 𝐴) → ((𝑋 ⊆ 𝑌 ∧ 𝑍 ⊆ 𝑊) → (𝑋 + 𝑍) ⊆ (𝑌 + 𝑊))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ⊆ wss 3903 ‘cfv 6502 (class class class)co 7370 Atomscatm 39668 +𝑃cpadd 40200 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-ov 7373 df-oprab 7374 df-mpo 7375 df-1st 7945 df-2nd 7946 df-padd 40201 |
| This theorem is referenced by: paddssw1 40248 paddunN 40332 pl42lem2N 40385 |
| Copyright terms: Public domain | W3C validator |