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 39841
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 2729 . . . . 5 (Atoms‘𝐾) = (Atoms‘𝐾)
3 paddidm.s . . . . 5 𝑆 = (PSubSp‘𝐾)
42, 3psubssat 39753 . . . 4 ((𝐾 ∈ HL ∧ 𝑋𝑆) → 𝑋 ⊆ (Atoms‘𝐾))
543adant3 1132 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → 𝑋 ⊆ (Atoms‘𝐾))
62, 3psubssat 39753 . . . 4 ((𝐾 ∈ HL ∧ 𝑌𝑆) → 𝑌 ⊆ (Atoms‘𝐾))
763adant2 1131 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → 𝑌 ⊆ (Atoms‘𝐾))
8 paddidm.p . . . 4 + = (+𝑃𝐾)
92, 8paddssat 39813 . . 3 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) → (𝑋 + 𝑌) ⊆ (Atoms‘𝐾))
101, 5, 7, 9syl3anc 1373 . 2 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑋 + 𝑌) ⊆ (Atoms‘𝐾))
11 olc 868 . . . . 5 ((𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → ((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))))
12 eqid 2729 . . . . . . . 8 (le‘𝐾) = (le‘𝐾)
13 eqid 2729 . . . . . . . 8 (join‘𝐾) = (join‘𝐾)
1412, 13, 2, 8elpadd 39798 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑋 + 𝑌) ⊆ (Atoms‘𝐾) ∧ (𝑋 + 𝑌) ⊆ (Atoms‘𝐾)) → (𝑝 ∈ ((𝑋 + 𝑌) + (𝑋 + 𝑌)) ↔ ((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)))))
151, 10, 10, 14syl3anc 1373 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑝 ∈ ((𝑋 + 𝑌) + (𝑋 + 𝑌)) ↔ ((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)))))
162, 8padd4N 39839 . . . . . . . . 9 ((𝐾 ∈ HL ∧ (𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) ∧ (𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾))) → ((𝑋 + 𝑌) + (𝑋 + 𝑌)) = ((𝑋 + 𝑋) + (𝑌 + 𝑌)))
171, 5, 7, 5, 7, 16syl122anc 1381 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑋 + 𝑌) + (𝑋 + 𝑌)) = ((𝑋 + 𝑋) + (𝑌 + 𝑌)))
183, 8paddidm 39840 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ 𝑋𝑆) → (𝑋 + 𝑋) = 𝑋)
19183adant3 1132 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑋 + 𝑋) = 𝑋)
203, 8paddidm 39840 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ 𝑌𝑆) → (𝑌 + 𝑌) = 𝑌)
21203adant2 1131 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑌 + 𝑌) = 𝑌)
2219, 21oveq12d 7367 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑋 + 𝑋) + (𝑌 + 𝑌)) = (𝑋 + 𝑌))
2317, 22eqtrd 2764 . . . . . . 7 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑋 + 𝑌) + (𝑋 + 𝑌)) = (𝑋 + 𝑌))
2423eleq2d 2814 . . . . . 6 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑝 ∈ ((𝑋 + 𝑌) + (𝑋 + 𝑌)) ↔ 𝑝 ∈ (𝑋 + 𝑌)))
2515, 24bitr3d 281 . . . . 5 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))) ↔ 𝑝 ∈ (𝑋 + 𝑌)))
2611, 25imbitrid 244 . . . 4 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → 𝑝 ∈ (𝑋 + 𝑌)))
2726expd 415 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑝 ∈ (Atoms‘𝐾) → (∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌))))
2827ralrimiv 3120 . 2 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ∀𝑝 ∈ (Atoms‘𝐾)(∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌)))
2912, 13, 2, 3ispsubsp2 39745 . . 3 (𝐾 ∈ HL → ((𝑋 + 𝑌) ∈ 𝑆 ↔ ((𝑋 + 𝑌) ⊆ (Atoms‘𝐾) ∧ ∀𝑝 ∈ (Atoms‘𝐾)(∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌)))))
30293ad2ant1 1133 . 2 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → ((𝑋 + 𝑌) ∈ 𝑆 ↔ ((𝑋 + 𝑌) ⊆ (Atoms‘𝐾) ∧ ∀𝑝 ∈ (Atoms‘𝐾)(∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌)))))
3110, 28, 30mpbir2and 713 1 ((𝐾 ∈ HL ∧ 𝑋𝑆𝑌𝑆) → (𝑋 + 𝑌) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 847  w3a 1086   = wceq 1540  wcel 2109  wral 3044  wrex 3053  wss 3903   class class class wbr 5092  cfv 6482  (class class class)co 7349  lecple 17168  joincjn 18217  Atomscatm 39262  HLchlt 39349  PSubSpcpsubsp 39495  +𝑃cpadd 39794
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-1st 7924  df-2nd 7925  df-proset 18200  df-poset 18219  df-plt 18234  df-lub 18250  df-glb 18251  df-join 18252  df-meet 18253  df-p0 18329  df-lat 18338  df-clat 18405  df-oposet 39175  df-ol 39177  df-oml 39178  df-covers 39265  df-ats 39266  df-atl 39297  df-cvlat 39321  df-hlat 39350  df-psubsp 39502  df-padd 39795
This theorem is referenced by:  pmodl42N  39850  pclun2N  39898
  Copyright terms: Public domain W3C validator