| 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 2761 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | eqid 2761 | . . 3 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 3 | padd0.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | padd0.p | . . 3 ⊢ + = (+𝑃‘𝐾) | |
| 5 | 1, 2, 3, 4 | paddval 40855 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)})) |
| 6 | unss 4136 | . . . . . 6 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ↔ (𝑋 ∪ 𝑌) ⊆ 𝐴) | |
| 7 | 6 | biimpi 219 | . . . . 5 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 ∪ 𝑌) ⊆ 𝐴) |
| 8 | ssrab2 4028 | . . . . 5 ⊢ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)} ⊆ 𝐴 | |
| 9 | 7, 8 | jctir 530 | . . . 4 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ((𝑋 ∪ 𝑌) ⊆ 𝐴 ∧ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)} ⊆ 𝐴)) |
| 10 | unss 4136 | . . . 4 ⊢ (((𝑋 ∪ 𝑌) ⊆ 𝐴 ∧ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)} ⊆ 𝐴) ↔ ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)}) ⊆ 𝐴) | |
| 11 | 9, 10 | sylib 221 | . . 3 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)}) ⊆ 𝐴) |
| 12 | 11 | 3adant1 1148 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)}) ⊆ 𝐴) |
| 13 | 5, 12 | eqsstrd 3965 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) ⊆ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 {crab 3413 ∪ cun 3897 ⊆ wss 3899 class class class wbr 5103 ‘cfv 6538 (class class class)co 7420 lecple 17435 joincjn 18485 Atomscatm 40320 +𝑃cpadd 40852 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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-padd 40853 |
| This theorem is used by: paddasslem8 40884 paddasslem11 40887 paddasslem12 40888 paddasslem13 40889 paddasslem16 40892 paddasslem17 40893 paddass 40895 padd4N 40897 paddclN 40899 pmodl42N 40908 pclunN 40955 paddunN 40984 pmapocjN 40987 pclfinclN 41007 osumcllem1N 41013 osumcllem2N 41014 osumcllem9N 41021 osumcllem11N 41023 osumclN 41024 pexmidlem6N 41032 pexmidlem8N 41034 pl42lem3N 41038 |
| Copyright terms: Public domain | W3C validator |