Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  paddclN Structured version   Visualization version   GIF version

Theorem paddclN 38378
Description: The projective sum of two subspaces is a subspace. Part of Lemma 16.2 of [MaedaMaeda] p. 68. (Contributed by NM, 14-Jan-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
paddidm.s 𝑆 = (PSubSp‘𝐾)
paddidm.p + = (+𝑃𝐾)
Assertion
Ref Expression
paddclN ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑋 + 𝑌) ∈ 𝑆)

Proof of Theorem paddclN
Dummy variables 𝑝 𝑞 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 1136 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → 𝐾 ∈ HL)
2 eqid 2731 . . . . 5 (Atoms‘𝐾) = (Atoms‘𝐾)
3 paddidm.s . . . . 5 𝑆 = (PSubSp‘𝐾)
42, 3psubssat 38290 . . . 4 ((𝐾 ∈ HL ∧ 𝑋𝑆) → 𝑋 ⊆ (Atoms‘𝐾))
543adant3 1132 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → 𝑋 ⊆ (Atoms‘𝐾))
62, 3psubssat 38290 . . . 4 ((𝐾 ∈ HL ∧ 𝑌𝑆) → 𝑌 ⊆ (Atoms‘𝐾))
763adant2 1131 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → 𝑌 ⊆ (Atoms‘𝐾))
8 paddidm.p . . . 4 + = (+𝑃𝐾)
92, 8paddssat 38350 . . 3 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) → (𝑋 + 𝑌) ⊆ (Atoms‘𝐾))
101, 5, 7, 9syl3anc 1371 . 2 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑋 + 𝑌) ⊆ (Atoms‘𝐾))
11 olc 866 . . . . 5 ((𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → ((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))))
12 eqid 2731 . . . . . . . 8 (le‘𝐾) = (le‘𝐾)
13 eqid 2731 . . . . . . . 8 (join‘𝐾) = (join‘𝐾)
1412, 13, 2, 8elpadd 38335 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑋 + 𝑌) ⊆ (Atoms‘𝐾) ∧ (𝑋 + 𝑌) ⊆ (Atoms‘𝐾)) → (𝑝 ∈ ((𝑋 + 𝑌) + (𝑋 + 𝑌)) ↔ ((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)))))
151, 10, 10, 14syl3anc 1371 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑝 ∈ ((𝑋 + 𝑌) + (𝑋 + 𝑌)) ↔ ((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)))))
162, 8padd4N 38376 . . . . . . . . 9 ((𝐾 ∈ HL ∧ (𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) ∧ (𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾))) → ((𝑋 + 𝑌) + (𝑋 + 𝑌)) = ((𝑋 + 𝑋) + (𝑌 + 𝑌)))
171, 5, 7, 5, 7, 16syl122anc 1379 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑋 + 𝑌) + (𝑋 + 𝑌)) = ((𝑋 + 𝑋) + (𝑌 + 𝑌)))
183, 8paddidm 38377 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ 𝑋𝑆) → (𝑋 + 𝑋) = 𝑋)
19183adant3 1132 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑋 + 𝑋) = 𝑋)
203, 8paddidm 38377 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ 𝑌𝑆) → (𝑌 + 𝑌) = 𝑌)
21203adant2 1131 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑌 + 𝑌) = 𝑌)
2219, 21oveq12d 7380 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑋 + 𝑋) + (𝑌 + 𝑌)) = (𝑋 + 𝑌))
2317, 22eqtrd 2771 . . . . . . 7 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑋 + 𝑌) + (𝑋 + 𝑌)) = (𝑋 + 𝑌))
2423eleq2d 2818 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑝 ∈ ((𝑋 + 𝑌) + (𝑋 + 𝑌)) ↔ 𝑝 ∈ (𝑋 + 𝑌)))
2515, 24bitr3d 280 . . . . 5 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))) ↔ 𝑝 ∈ (𝑋 + 𝑌)))
2611, 25imbitrid 243 . . . 4 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → 𝑝 ∈ (𝑋 + 𝑌)))
2726expd 416 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑝 ∈ (Atoms‘𝐾) → (∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌))))
2827ralrimiv 3138 . 2 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ∀𝑝 ∈ (Atoms‘𝐾)(∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌)))
2912, 13, 2, 3ispsubsp2 38282 . . 3 (𝐾 ∈ HL → ((𝑋 + 𝑌) ∈ 𝑆 ↔ ((𝑋 + 𝑌) ⊆ (Atoms‘𝐾) ∧ ∀𝑝 ∈ (Atoms‘𝐾)(∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌)))))
30293ad2ant1 1133 . 2 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑋 + 𝑌) ∈ 𝑆 ↔ ((𝑋 + 𝑌) ⊆ (Atoms‘𝐾) ∧ ∀𝑝 ∈ (Atoms‘𝐾)(∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌)))))
3110, 28, 30mpbir2and 711 1 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑋 + 𝑌) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  wo 845  w3a 1087   = wceq 1541  wcel 2106  wral 3060  wrex 3069  wss 3913   class class class wbr 5110  cfv 6501  (class class class)co 7362  lecple 17154  joincjn 18214  Atomscatm 37798  HLchlt 37885  PSubSpcpsubsp 38032  +𝑃cpadd 38331
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  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 2702  ax-rep 5247  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-id 5536  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-riota 7318  df-ov 7365  df-oprab 7366  df-mpo 7367  df-1st 7926  df-2nd 7927  df-proset 18198  df-poset 18216  df-plt 18233  df-lub 18249  df-glb 18250  df-join 18251  df-meet 18252  df-p0 18328  df-lat 18335  df-clat 18402  df-oposet 37711  df-ol 37713  df-oml 37714  df-covers 37801  df-ats 37802  df-atl 37833  df-cvlat 37857  df-hlat 37886  df-psubsp 38039  df-padd 38332
This theorem is referenced by:  pmodl42N  38387  pclun2N  38435
  Copyright terms: Public domain W3C validator