Theorem pexmidlem6N 37113

Description: Lemma for pexmidN 37107. (Contributed by NM, 3-Feb-2012.) (New usage is discouraged.)

Hypotheses

Ref	Expression
pexmidlem.l	⊢ ≤ = (le‘𝐾)
pexmidlem.j	⊢ ∨ = (join‘𝐾)
pexmidlem.a	⊢ 𝐴 = (Atoms‘𝐾)
pexmidlem.p	⊢ + = (+𝑃‘𝐾)
pexmidlem.o	⊢ ⊥ = (⊥𝑃‘𝐾)
pexmidlem.m	⊢ 𝑀 = (𝑋 + {𝑝})

Assertion

Ref	Expression
pexmidlem6N	⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑀 = 𝑋)

Proof of Theorem pexmidlem6N

Step	Hyp	Ref	Expression
1		pexmidlem.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
2		pexmidlem.j	. . . . . . . 8 ⊢ ∨ = (join‘𝐾)
3		pexmidlem.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
4		pexmidlem.p	. . . . . . . 8 ⊢ + = (+𝑃‘𝐾)
5		pexmidlem.o	. . . . . . . 8 ⊢ ⊥ = (⊥𝑃‘𝐾)
6		pexmidlem.m	. . . . . . . 8 ⊢ 𝑀 = (𝑋 + {𝑝})
7	1, 2, 3, 4, 5, 6	pexmidlem5N 37112	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (( ⊥ ‘𝑋) ∩ 𝑀) = ∅)
8	7	3adantr1 1165	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (( ⊥ ‘𝑋) ∩ 𝑀) = ∅)
9	8	fveq2d 6676	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → ( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑀)) = ( ⊥ ‘∅))
10		simpl1 1187	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝐾 ∈ HL)
11	3, 5	pol0N 37047	. . . . . 6 ⊢ (𝐾 ∈ HL → ( ⊥ ‘∅) = 𝐴)
12	10, 11	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → ( ⊥ ‘∅) = 𝐴)
13	9, 12	eqtrd 2858	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → ( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑀)) = 𝐴)
14	13	ineq1d 4190	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑀)) ∩ 𝑀) = (𝐴 ∩ 𝑀))
15		simpl2 1188	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑋 ⊆ 𝐴)
16		simpl3 1189	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑝 ∈ 𝐴)
17	16	snssd 4744	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → {𝑝} ⊆ 𝐴)
18	3, 4	paddssat 36952	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ {𝑝} ⊆ 𝐴) → (𝑋 + {𝑝}) ⊆ 𝐴)
19	10, 15, 17, 18	syl3anc 1367	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (𝑋 + {𝑝}) ⊆ 𝐴)
20	6, 19	eqsstrid 4017	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑀 ⊆ 𝐴)
21	10, 15, 20	3jca 1124	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑀 ⊆ 𝐴))
22	3, 4	sspadd1 36953	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ {𝑝} ⊆ 𝐴) → 𝑋 ⊆ (𝑋 + {𝑝}))
23	10, 15, 17, 22	syl3anc 1367	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑋 ⊆ (𝑋 + {𝑝}))
24	23, 6	sseqtrrdi 4020	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑋 ⊆ 𝑀)
25		simpr1 1190	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋)
26		eqid 2823	. . . . . . . . . . 11 ⊢ (PSubCl‘𝐾) = (PSubCl‘𝐾)
27	3, 5, 26	ispsubclN 37075	. . . . . . . . . 10 ⊢ (𝐾 ∈ HL → (𝑋 ∈ (PSubCl‘𝐾) ↔ (𝑋 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋)))
28	10, 27	syl 17	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (𝑋 ∈ (PSubCl‘𝐾) ↔ (𝑋 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋)))
29	15, 25, 28	mpbir2and 711	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑋 ∈ (PSubCl‘𝐾))
30	3, 4, 26	paddatclN 37087	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ (PSubCl‘𝐾) ∧ 𝑝 ∈ 𝐴) → (𝑋 + {𝑝}) ∈ (PSubCl‘𝐾))
31	10, 29, 16, 30	syl3anc 1367	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (𝑋 + {𝑝}) ∈ (PSubCl‘𝐾))
32	6, 31	eqeltrid 2919	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑀 ∈ (PSubCl‘𝐾))
33	5, 26	psubcli2N 37077	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑀 ∈ (PSubCl‘𝐾)) → ( ⊥ ‘( ⊥ ‘𝑀)) = 𝑀)
34	10, 32, 33	syl2anc 586	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → ( ⊥ ‘( ⊥ ‘𝑀)) = 𝑀)
35	24, 34	jca 514	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (𝑋 ⊆ 𝑀 ∧ ( ⊥ ‘( ⊥ ‘𝑀)) = 𝑀))
36	3, 5	poml4N 37091	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑀 ⊆ 𝐴) → ((𝑋 ⊆ 𝑀 ∧ ( ⊥ ‘( ⊥ ‘𝑀)) = 𝑀) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑀)) ∩ 𝑀) = ( ⊥ ‘( ⊥ ‘𝑋))))
37	21, 35, 36	sylc 65	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑀)) ∩ 𝑀) = ( ⊥ ‘( ⊥ ‘𝑋)))
38		sseqin2 4194	. . . 4 ⊢ (𝑀 ⊆ 𝐴 ↔ (𝐴 ∩ 𝑀) = 𝑀)
39	20, 38	sylib 220	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (𝐴 ∩ 𝑀) = 𝑀)
40	14, 37, 39	3eqtr3rd 2867	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑀 = ( ⊥ ‘( ⊥ ‘𝑋)))
41	40, 25	eqtrd 2858	1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ 𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → 𝑀 = 𝑋)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114   ≠ wne 3018   ∩ cin 3937   ⊆ wss 3938  ∅c0 4293  {csn 4569  ‘cfv 6357  (class class class)co 7158  lecple 16574  joincjn 17556  Atomscatm 36401  HLchlt 36488  +_𝑃cpadd 36933  ⊥_𝑃cpolN 37040  PSubClcpscN 37072

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-riotaBAD 36091

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-iin 4924  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-1st 7691  df-2nd 7692  df-undef 7941  df-proset 17540  df-poset 17558  df-plt 17570  df-lub 17586  df-glb 17587  df-join 17588  df-meet 17589  df-p0 17651  df-p1 17652  df-lat 17658  df-clat 17720  df-oposet 36314  df-ol 36316  df-oml 36317  df-covers 36404  df-ats 36405  df-atl 36436  df-cvlat 36460  df-hlat 36489  df-psubsp 36641  df-pmap 36642  df-padd 36934  df-polarityN 37041  df-psubclN 37073

This theorem is referenced by:  pexmidlem8N  37115