Theorem paddclN 41090

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.

Step	Hyp	Ref	Expression
1		simp1 1154	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝐾 ∈ HL)
2		eqid 2763	. . . . 5 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
3		paddidm.s	. . . . 5 ⊢ 𝑆 = (PSubSp‘𝐾)
4	2, 3	psubssat 41002	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾))
5	4	3adant3 1150	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾))
6	2, 3	psubssat 41002	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝑆) → 𝑌 ⊆ (Atoms‘𝐾))
7	6	3adant2 1149	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ⊆ (Atoms‘𝐾))
8		paddidm.p	. . . 4 ⊢ + = (+𝑃‘𝐾)
9	2, 8	paddssat 41062	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) → (𝑋 + 𝑌) ⊆ (Atoms‘𝐾))
10	1, 5, 7, 9	syl3anc 1399	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ⊆ (Atoms‘𝐾))
11		olc 882	. . . . 5 ⊢ ((𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → ((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))))
12		eqid 2763	. . . . . . . 8 ⊢ (le‘𝐾) = (le‘𝐾)
13		eqid 2763	. . . . . . . 8 ⊢ (join‘𝐾) = (join‘𝐾)
14	12, 13, 2, 8	elpadd 41047	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 + 𝑌) ⊆ (Atoms‘𝐾) ∧ (𝑋 + 𝑌) ⊆ (Atoms‘𝐾)) → (𝑝 ∈ ((𝑋 + 𝑌) + (𝑋 + 𝑌)) ↔ ((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)))))
15	1, 10, 10, 14	syl3anc 1399	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑝 ∈ ((𝑋 + 𝑌) + (𝑋 + 𝑌)) ↔ ((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)))))
16	2, 8	padd4N 41088	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) ∧ (𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾))) → ((𝑋 + 𝑌) + (𝑋 + 𝑌)) = ((𝑋 + 𝑋) + (𝑌 + 𝑌)))
17	1, 5, 7, 5, 7, 16	syl122anc 1407	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((𝑋 + 𝑌) + (𝑋 + 𝑌)) = ((𝑋 + 𝑋) + (𝑌 + 𝑌)))
18	3, 8	paddidm 41089	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆) → (𝑋 + 𝑋) = 𝑋)
19	18	3adant3 1150	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑋) = 𝑋)
20	3, 8	paddidm 41089	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝑆) → (𝑌 + 𝑌) = 𝑌)
21	20	3adant2 1149	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑌 + 𝑌) = 𝑌)
22	19, 21	oveq12d 7458	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((𝑋 + 𝑋) + (𝑌 + 𝑌)) = (𝑋 + 𝑌))
23	17, 22	eqtrd 2798	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((𝑋 + 𝑌) + (𝑋 + 𝑌)) = (𝑋 + 𝑌))
24	23	eleq2d 2850	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑝 ∈ ((𝑋 + 𝑌) + (𝑋 + 𝑌)) ↔ 𝑝 ∈ (𝑋 + 𝑌)))
25	15, 24	bitr3d 284	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (((𝑝 ∈ (𝑋 + 𝑌) ∨ 𝑝 ∈ (𝑋 + 𝑌)) ∨ (𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟))) ↔ 𝑝 ∈ (𝑋 + 𝑌)))
26	11, 25	imbitrid 247	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((𝑝 ∈ (Atoms‘𝐾) ∧ ∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟)) → 𝑝 ∈ (𝑋 + 𝑌)))
27	26	expd 421	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑝 ∈ (Atoms‘𝐾) → (∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌))))
28	27	ralrimiv 3157	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ∀𝑝 ∈ (Atoms‘𝐾)(∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌)))
29	12, 13, 2, 3	ispsubsp2 40994	. . 3 ⊢ (𝐾 ∈ HL → ((𝑋 + 𝑌) ∈ 𝑆 ↔ ((𝑋 + 𝑌) ⊆ (Atoms‘𝐾) ∧ ∀𝑝 ∈ (Atoms‘𝐾)(∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌)))))
30	29	3ad2ant1 1151	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((𝑋 + 𝑌) ∈ 𝑆 ↔ ((𝑋 + 𝑌) ⊆ (Atoms‘𝐾) ∧ ∀𝑝 ∈ (Atoms‘𝐾)(∃𝑞 ∈ (𝑋 + 𝑌)∃𝑟 ∈ (𝑋 + 𝑌)𝑝(le‘𝐾)(𝑞(join‘𝐾)𝑟) → 𝑝 ∈ (𝑋 + 𝑌)))))
31	10, 28, 30	mpbir2and 726	1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ∈ 𝑆)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  lecple 17461  joincjn 18511  Atomscatm 40511  HLchlt 40598  PSubSpcpsubsp 40744  +_𝑃cpadd 41043

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-proset 18494  df-poset 18513  df-plt 18528  df-lub 18544  df-glb 18545  df-join 18546  df-meet 18547  df-p0 18623  df-lat 18632  df-clat 18699  df-oposet 40424  df-ol 40426  df-oml 40427  df-covers 40514  df-ats 40515  df-atl 40546  df-cvlat 40570  df-hlat 40599  df-psubsp 40751  df-padd 41044

This theorem is used by:  pmodl42N  41099  pclun2N  41147