| 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 4149 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 487 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝐾 ∈ 𝐵) | |
| 2 | simpr1 1211 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝑋 ⊆ 𝐴) | |
| 3 | simpr2 1212 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝑌 ⊆ 𝐴) | |
| 4 | paddss.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | paddss.s | . . . . . 6 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 6 | 4, 5 | psubssat 40453 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑍 ∈ 𝑆) → 𝑍 ⊆ 𝐴) |
| 7 | 6 | 3ad2antr3 1207 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝑍 ⊆ 𝐴) |
| 8 | paddss.p | . . . . 5 ⊢ + = (+𝑃‘𝐾) | |
| 9 | 4, 8 | paddssw1 40542 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) → (𝑋 + 𝑌) ⊆ (𝑍 + 𝑍))) |
| 10 | 1, 2, 3, 7, 9 | syl13anc 1397 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) → (𝑋 + 𝑌) ⊆ (𝑍 + 𝑍))) |
| 11 | 5, 8 | paddidm 40540 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑍 ∈ 𝑆) → (𝑍 + 𝑍) = 𝑍) |
| 12 | 11 | 3ad2antr3 1207 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → (𝑍 + 𝑍) = 𝑍) |
| 13 | 12 | sseq2d 3975 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 + 𝑌) ⊆ (𝑍 + 𝑍) ↔ (𝑋 + 𝑌) ⊆ 𝑍)) |
| 14 | 10, 13 | sylibd 242 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) → (𝑋 + 𝑌) ⊆ 𝑍)) |
| 15 | 4, 8 | paddssw2 40543 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑋 + 𝑌) ⊆ 𝑍 → (𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍))) |
| 16 | 1, 2, 3, 7, 15 | syl13anc 1397 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 + 𝑌) ⊆ 𝑍 → (𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍))) |
| 17 | 14, 16 | impbid 215 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) ↔ (𝑋 + 𝑌) ⊆ 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ⊆ wss 3911 ‘cfv 6537 (class class class)co 7411 Atomscatm 39962 PSubSpcpsubsp 40195 +𝑃cpadd 40494 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7986 df-2nd 7987 df-psubsp 40202 df-padd 40495 |
| This theorem is referenced by: pmodlem1 40545 pclunN 40597 osumcllem1N 40655 |
| Copyright terms: Public domain | W3C validator |