| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > paddssat | Structured version Visualization version GIF version | ||
| Description: A projective subspace sum is a set of atoms. (Contributed by NM, 3-Jan-2012.) |
| Ref | Expression |
|---|---|
| padd0.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| padd0.p | ⊢ + = (+𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| paddssat | ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) ⊆ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | eqid 2763 | . . 3 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 3 | padd0.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | padd0.p | . . 3 ⊢ + = (+𝑃‘𝐾) | |
| 5 | 1, 2, 3, 4 | paddval 40998 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)})) |
| 6 | unss 4191 | . . . . . 6 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ↔ (𝑋 ∪ 𝑌) ⊆ 𝐴) | |
| 7 | 6 | biimpi 219 | . . . . 5 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 ∪ 𝑌) ⊆ 𝐴) |
| 8 | ssrab2 4008 | . . . . 5 ⊢ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)} ⊆ 𝐴 | |
| 9 | 7, 8 | jctir 530 | . . . 4 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ((𝑋 ∪ 𝑌) ⊆ 𝐴 ∧ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)} ⊆ 𝐴)) |
| 10 | unss 4191 | . . . 4 ⊢ (((𝑋 ∪ 𝑌) ⊆ 𝐴 ∧ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)} ⊆ 𝐴) ↔ ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)}) ⊆ 𝐴) | |
| 11 | 9, 10 | sylib 221 | . . 3 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)}) ⊆ 𝐴) |
| 12 | 11 | 3adant1 1148 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)}) ⊆ 𝐴) |
| 13 | 5, 12 | eqsstrd 3947 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) ⊆ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 ∃wrex 3090 {crab 3416 ⊆ wss 3900 ∪ cun 4152 class class class wbr 5106 ‘cfv 6547 (class class class)co 7430 lecple 17450 joincjn 18500 Atomscatm 40463 +𝑃cpadd 40995 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 |
| 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 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 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 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-ov 7433 df-oprab 7434 df-mpo 7435 df-1st 8011 df-2nd 8012 df-padd 40996 |
| This theorem is used by: paddasslem8 41027 paddasslem11 41030 paddasslem12 41031 paddasslem13 41032 paddasslem16 41035 paddasslem17 41036 paddass 41038 padd4N 41040 paddclN 41042 pmodl42N 41051 pclunN 41098 paddunN 41127 pmapocjN 41130 pclfinclN 41150 osumcllem1N 41156 osumcllem2N 41157 osumcllem9N 41164 osumcllem11N 41166 osumclN 41167 pexmidlem6N 41175 pexmidlem8N 41177 pl42lem3N 41181 |
| Copyright terms: Public domain | W3C validator |