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 483 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → 𝐾 ∈ 𝐵) | |
2 | eqid 2738 | . . . . . 6 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
3 | paddidm.s | . . . . . 6 ⊢ 𝑆 = (PSubSp‘𝐾) | |
4 | 2, 3 | psubssat 37768 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
5 | eqid 2738 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
6 | eqid 2738 | . . . . . 6 ⊢ (join‘𝐾) = (join‘𝐾) | |
7 | paddidm.p | . . . . . 6 ⊢ + = (+𝑃‘𝐾) | |
8 | 5, 6, 2, 7 | elpadd 37813 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑋 ⊆ (Atoms‘𝐾)) → (𝑝 ∈ (𝑋 + 𝑋) ↔ ((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))))) |
9 | 1, 4, 4, 8 | syl3anc 1370 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑝 ∈ (𝑋 + 𝑋) ↔ ((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))))) |
10 | pm1.2 901 | . . . . . 6 ⊢ ((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) → 𝑝 ∈ 𝑋) | |
11 | 10 | a1i 11 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → ((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) → 𝑝 ∈ 𝑋)) |
12 | 5, 6, 2, 3 | psubspi 37761 | . . . . . . 7 ⊢ (((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆 ∧ 𝑝 ∈ (Atoms‘𝐾)) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → 𝑝 ∈ 𝑋) |
13 | 12 | 3exp1 1351 | . . . . . 6 ⊢ (𝐾 ∈ 𝐵 → (𝑋 ∈ 𝑆 → (𝑝 ∈ (Atoms‘𝐾) → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ 𝑋)))) |
14 | 13 | imp4b 422 | . . . . 5 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → ((𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → 𝑝 ∈ 𝑋)) |
15 | 11, 14 | jaod 856 | . . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (((𝑝 ∈ 𝑋 ∨ 𝑝 ∈ 𝑋) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))) → 𝑝 ∈ 𝑋)) |
16 | 9, 15 | sylbid 239 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑝 ∈ (𝑋 + 𝑋) → 𝑝 ∈ 𝑋)) |
17 | 16 | ssrdv 3927 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑋 + 𝑋) ⊆ 𝑋) |
18 | 2, 7 | sspadd1 37829 | . . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑋 ⊆ (Atoms‘𝐾)) → 𝑋 ⊆ (𝑋 + 𝑋)) |
19 | 1, 4, 4, 18 | syl3anc 1370 | . 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (𝑋 + 𝑋)) |
20 | 17, 19 | eqssd 3938 | 1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝑆) → (𝑋 + 𝑋) = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 844 = wceq 1539 ∈ wcel 2106 ∃wrex 3065 ⊆ wss 3887 class class class wbr 5074 ‘cfv 6433 (class class class)co 7275 lecple 16969 joincjn 18029 Atomscatm 37277 PSubSpcpsubsp 37510 +𝑃cpadd 37809 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-1st 7831 df-2nd 7832 df-psubsp 37517 df-padd 37810 |
This theorem is referenced by: paddclN 37856 paddss 37859 pmod1i 37862 |
Copyright terms: Public domain | W3C validator |