| 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 2765 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | eqid 2765 | . . 3 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 3 | padd0.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | padd0.p | . . 3 ⊢ + = (+𝑃‘𝐾) | |
| 5 | 1, 2, 3, 4 | paddval 40632 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)})) |
| 6 | unss 4143 | . . . . . 6 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) ↔ (𝑋 ∪ 𝑌) ⊆ 𝐴) | |
| 7 | 6 | biimpi 219 | . . . . 5 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 ∪ 𝑌) ⊆ 𝐴) |
| 8 | ssrab2 4035 | . . . . 5 ⊢ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)} ⊆ 𝐴 | |
| 9 | 7, 8 | jctir 530 | . . . 4 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ((𝑋 ∪ 𝑌) ⊆ 𝐴 ∧ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)} ⊆ 𝐴)) |
| 10 | unss 4143 | . . . 4 ⊢ (((𝑋 ∪ 𝑌) ⊆ 𝐴 ∧ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)} ⊆ 𝐴) ↔ ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)}) ⊆ 𝐴) | |
| 11 | 9, 10 | sylib 221 | . . 3 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)}) ⊆ 𝐴) |
| 12 | 11 | 3adant1 1148 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)}) ⊆ 𝐴) |
| 13 | 5, 12 | eqsstrd 3972 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) ⊆ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 {crab 3418 ∪ cun 3904 ⊆ wss 3906 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 lecple 17341 joincjn 18391 Atomscatm 40097 +𝑃cpadd 40629 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-1st 7992 df-2nd 7993 df-padd 40630 |
| This theorem is used by: paddasslem8 40661 paddasslem11 40664 paddasslem12 40665 paddasslem13 40666 paddasslem16 40669 paddasslem17 40670 paddass 40672 padd4N 40674 paddclN 40676 pmodl42N 40685 pclunN 40732 paddunN 40761 pmapocjN 40764 pclfinclN 40784 osumcllem1N 40790 osumcllem2N 40791 osumcllem9N 40798 osumcllem11N 40800 osumclN 40801 pexmidlem6N 40809 pexmidlem8N 40811 pl42lem3N 40815 |
| Copyright terms: Public domain | W3C validator |