| 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 4143 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 482 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝐾 ∈ 𝐵) | |
| 2 | simpr1 1196 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝑋 ⊆ 𝐴) | |
| 3 | simpr2 1197 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝑌 ⊆ 𝐴) | |
| 4 | paddss.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | paddss.s | . . . . . 6 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 6 | 4, 5 | psubssat 40082 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑍 ∈ 𝑆) → 𝑍 ⊆ 𝐴) |
| 7 | 6 | 3ad2antr3 1192 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → 𝑍 ⊆ 𝐴) |
| 8 | paddss.p | . . . . 5 ⊢ + = (+𝑃‘𝐾) | |
| 9 | 4, 8 | paddssw1 40171 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) → (𝑋 + 𝑌) ⊆ (𝑍 + 𝑍))) |
| 10 | 1, 2, 3, 7, 9 | syl13anc 1375 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) → (𝑋 + 𝑌) ⊆ (𝑍 + 𝑍))) |
| 11 | 5, 8 | paddidm 40169 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑍 ∈ 𝑆) → (𝑍 + 𝑍) = 𝑍) |
| 12 | 11 | 3ad2antr3 1192 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → (𝑍 + 𝑍) = 𝑍) |
| 13 | 12 | sseq2d 3967 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 + 𝑌) ⊆ (𝑍 + 𝑍) ↔ (𝑋 + 𝑌) ⊆ 𝑍)) |
| 14 | 10, 13 | sylibd 239 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) → (𝑋 + 𝑌) ⊆ 𝑍)) |
| 15 | 4, 8 | paddssw2 40172 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑋 + 𝑌) ⊆ 𝑍 → (𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍))) |
| 16 | 1, 2, 3, 7, 15 | syl13anc 1375 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 + 𝑌) ⊆ 𝑍 → (𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍))) |
| 17 | 14, 16 | impbid 212 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ∈ 𝑆)) → ((𝑋 ⊆ 𝑍 ∧ 𝑌 ⊆ 𝑍) ↔ (𝑋 + 𝑌) ⊆ 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ⊆ wss 3902 ‘cfv 6493 (class class class)co 7360 Atomscatm 39591 PSubSpcpsubsp 39824 +𝑃cpadd 40123 |
| 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 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 |
| 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 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-oprab 7364 df-mpo 7365 df-1st 7935 df-2nd 7936 df-psubsp 39831 df-padd 40124 |
| This theorem is referenced by: pmodlem1 40174 pclunN 40226 osumcllem1N 40284 |
| Copyright terms: Public domain | W3C validator |