| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > paddss | Structured version Visualization version GIF version | ||
| Description: Subset law for projective subspace sum. (unss 4188 analog.) (Contributed by NM, 7-Mar-2012.) |
| Ref | Expression |
|---|---|
| paddss.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| paddss.s | ⊢ 𝑆 = (PSubSp‘𝐾) |
| paddss.p | ⊢ + = (+𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| paddss | ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) ↔ (𝑋 + 𝑌) ⊆ 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝐾 ∈ 𝐵) | |
| 2 | simpr1 1213 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝑋 ⊆ 𝐴) | |
| 3 | simpr2 1214 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝑌 ⊆ 𝐴) | |
| 4 | paddss.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | paddss.s | . . . . . 6 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 6 | 4, 5 | psubssat 40812 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑍 ∈ 𝑆) → 𝑍 ⊆ 𝐴) |
| 7 | 6 | 3ad2antr3 1209 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝑍 ⊆ 𝐴) |
| 8 | paddss.p | . . . . 5 ⊢ + = (+𝑃‘𝐾) | |
| 9 | 4, 8 | paddssw1 40901 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) → (𝑋 + 𝑌) ⊆ (𝑍 + 𝑍))) |
| 10 | 1, 2, 3, 7, 9 | syl13anc 1399 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) → (𝑋 + 𝑌) ⊆ (𝑍 + 𝑍))) |
| 11 | 5, 8 | paddidm 40899 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑍 ∈ 𝑆) → (𝑍 + 𝑍) = 𝑍) |
| 12 | 11 | 3ad2antr3 1209 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → (𝑍 + 𝑍) = 𝑍) |
| 13 | 12 | sseq2d 3940 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 + 𝑌) ⊆ (𝑍 + 𝑍) ↔ (𝑋 + 𝑌) ⊆ 𝑍)) |
| 14 | 10, 13 | sylibd 242 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) → (𝑋 + 𝑌) ⊆ 𝑍)) |
| 15 | 4, 8 | paddssw2 40902 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑋 + 𝑌) ⊆ 𝑍 → (𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍))) |
| 16 | 1, 2, 3, 7, 15 | syl13anc 1399 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 + 𝑌) ⊆ 𝑍 → (𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍))) |
| 17 | 14, 16 | impbid 215 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) ↔ (𝑋 + 𝑌) ⊆ 𝑍)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ‘cfv 6538 (class class class)co 7420 Atomscatm 40321 PSubSpcpsubsp 40554 +𝑃cpadd 40853 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-psubsp 40561 df-padd 40854 |
| This theorem is used by: pmodlem1 40904 pclunN 40956 osumcllem1N 41014 |
| Copyright terms: Public domain | W3C validator |