| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > paddidm | Structured version Visualization version GIF version | ||
| Description: Projective subspace sum is idempotent. Part of Lemma 16.2 of [MaedaMaeda] p. 68. (Contributed by NM, 13-Jan-2012.) |
| Ref | Expression |
|---|---|
| paddidm.s | ⊢ 𝑆 = (PSubSp‘𝐾) |
| paddidm.p | ⊢ + = (+𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| paddidm | ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑋 + 𝑋) = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 487 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → 𝐾 ∈ 𝐵) | |
| 2 | eqid 2769 | . . . . . 6 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | paddidm.s | . . . . . 6 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 4 | 2, 3 | psubssat 40453 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 5 | eqid 2769 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 6 | eqid 2769 | . . . . . 6 ⊢ (join‘𝐾) = (join‘𝐾) | |
| 7 | paddidm.p | . . . . . 6 ⊢ + = (+𝑃‘𝐾) | |
| 8 | 5, 6, 2, 7 | elpadd 40498 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑋 ⊆ (Atoms‘𝐾)) → (𝑝 ∈ (𝑋 + 𝑋) ↔ ((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))))) |
| 9 | 1, 4, 4, 8 | syl3anc 1396 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑝 ∈ (𝑋 + 𝑋) ↔ ((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))))) |
| 10 | pm1.2 916 | . . . . . 6 ⊢ ((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) → 𝑝 ∈ 𝑋) | |
| 11 | 10 | a1i 11 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → ((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) → 𝑝 ∈ 𝑋)) |
| 12 | 5, 6, 2, 3 | psubspi 40446 | . . . . . . 7 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆 ∧ 𝑝 ∈ (Atoms‘𝐾)) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → 𝑝 ∈ 𝑋) |
| 13 | 12 | 3exp1 1369 | . . . . . 6 ⊢ (𝐾 ∈ 𝐵 → (𝑋 ∈ 𝑆 → (𝑝 ∈ (Atoms‘𝐾) → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ 𝑋)))) |
| 14 | 13 | imp4b 426 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → ((𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → 𝑝 ∈ 𝑋)) |
| 15 | 11, 14 | jaod 872 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))) → 𝑝 ∈ 𝑋)) |
| 16 | 9, 15 | sylbid 243 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑝 ∈ (𝑋 + 𝑋) → 𝑝 ∈ 𝑋)) |
| 17 | 16 | ssrdv 3949 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑋 + 𝑋) ⊆ 𝑋) |
| 18 | 2, 7 | sspadd1 40514 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑋 ⊆ (Atoms‘𝐾)) → 𝑋 ⊆ (𝑋 + 𝑋)) |
| 19 | 1, 4, 4, 18 | syl3anc 1396 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (𝑋 + 𝑋)) |
| 20 | 17, 19 | eqssd 3960 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑋 + 𝑋) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1567 ∈ wcel 2149 ∃wrex 3095 ⊆ wss 3911 class class class wbr 5111 ‘cfv 6537 (class class class)co 7411 lecple 17317 joincjn 18367 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: paddclN 40541 paddss 40544 pmod1i 40547 |
| Copyright terms: Public domain | W3C validator |