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

Theorem cdleme0cp 35996
Description: Part of proof of Lemma E in [Crawley] p. 113. TODO: Reformat as in cdlemg3a 36379- swap consequent equality; make antecedent use df-3an 1102. (Contributed by NM, 13-Jun-2012.)
Hypotheses
Ref Expression
cdleme0.l = (le‘𝐾)
cdleme0.j = (join‘𝐾)
cdleme0.m = (meet‘𝐾)
cdleme0.a 𝐴 = (Atoms‘𝐾)
cdleme0.h 𝐻 = (LHyp‘𝐾)
cdleme0.u 𝑈 = ((𝑃 𝑄) 𝑊)
Assertion
Ref Expression
cdleme0cp (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → (𝑃 𝑈) = (𝑃 𝑄))

Proof of Theorem cdleme0cp
StepHypRef Expression
1 cdleme0.u . . 3 𝑈 = ((𝑃 𝑄) 𝑊)
21oveq2i 6888 . 2 (𝑃 𝑈) = (𝑃 ((𝑃 𝑄) 𝑊))
3 simpll 774 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → 𝐾 ∈ HL)
4 simprll 788 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → 𝑃𝐴)
5 hllat 35145 . . . . . 6 (𝐾 ∈ HL → 𝐾 ∈ Lat)
65ad2antrr 708 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → 𝐾 ∈ Lat)
7 eqid 2813 . . . . . . 7 (Base‘𝐾) = (Base‘𝐾)
8 cdleme0.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
97, 8atbase 35071 . . . . . 6 (𝑃𝐴𝑃 ∈ (Base‘𝐾))
104, 9syl 17 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → 𝑃 ∈ (Base‘𝐾))
11 simprr 780 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → 𝑄𝐴)
127, 8atbase 35071 . . . . . 6 (𝑄𝐴𝑄 ∈ (Base‘𝐾))
1311, 12syl 17 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → 𝑄 ∈ (Base‘𝐾))
14 cdleme0.j . . . . . 6 = (join‘𝐾)
157, 14latjcl 17259 . . . . 5 ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) → (𝑃 𝑄) ∈ (Base‘𝐾))
166, 10, 13, 15syl3anc 1483 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → (𝑃 𝑄) ∈ (Base‘𝐾))
17 cdleme0.h . . . . . 6 𝐻 = (LHyp‘𝐾)
187, 17lhpbase 35780 . . . . 5 (𝑊𝐻𝑊 ∈ (Base‘𝐾))
1918ad2antlr 709 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → 𝑊 ∈ (Base‘𝐾))
20 cdleme0.l . . . . . 6 = (le‘𝐾)
2120, 14, 8hlatlej1 35157 . . . . 5 ((𝐾 ∈ HL ∧ 𝑃𝐴𝑄𝐴) → 𝑃 (𝑃 𝑄))
223, 4, 11, 21syl3anc 1483 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → 𝑃 (𝑃 𝑄))
23 cdleme0.m . . . . 5 = (meet‘𝐾)
247, 20, 14, 23, 8atmod3i1 35646 . . . 4 ((𝐾 ∈ HL ∧ (𝑃𝐴 ∧ (𝑃 𝑄) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) ∧ 𝑃 (𝑃 𝑄)) → (𝑃 ((𝑃 𝑄) 𝑊)) = ((𝑃 𝑄) (𝑃 𝑊)))
253, 4, 16, 19, 22, 24syl131anc 1495 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → (𝑃 ((𝑃 𝑄) 𝑊)) = ((𝑃 𝑄) (𝑃 𝑊)))
26 eqid 2813 . . . . . 6 (1.‘𝐾) = (1.‘𝐾)
2720, 14, 26, 8, 17lhpjat2 35803 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝑃 𝑊) = (1.‘𝐾))
2827adantrr 699 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → (𝑃 𝑊) = (1.‘𝐾))
2928oveq2d 6893 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → ((𝑃 𝑄) (𝑃 𝑊)) = ((𝑃 𝑄) (1.‘𝐾)))
30 hlol 35143 . . . . 5 (𝐾 ∈ HL → 𝐾 ∈ OL)
3130ad2antrr 708 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → 𝐾 ∈ OL)
327, 23, 26olm11 35009 . . . 4 ((𝐾 ∈ OL ∧ (𝑃 𝑄) ∈ (Base‘𝐾)) → ((𝑃 𝑄) (1.‘𝐾)) = (𝑃 𝑄))
3331, 16, 32syl2anc 575 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → ((𝑃 𝑄) (1.‘𝐾)) = (𝑃 𝑄))
3425, 29, 333eqtrd 2851 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → (𝑃 ((𝑃 𝑄) 𝑊)) = (𝑃 𝑄))
352, 34syl5eq 2859 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴)) → (𝑃 𝑈) = (𝑃 𝑄))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384   = wceq 1637  wcel 2157   class class class wbr 4851  cfv 6104  (class class class)co 6877  Basecbs 16071  lecple 16163  joincjn 17152  meetcmee 17153  1.cp1 17246  Latclat 17253  OLcol 34956  Atomscatm 35045  HLchlt 35132  LHypclh 35766
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2069  ax-7 2105  ax-8 2159  ax-9 2166  ax-10 2186  ax-11 2202  ax-12 2215  ax-13 2422  ax-ext 2791  ax-rep 4971  ax-sep 4982  ax-nul 4990  ax-pow 5042  ax-pr 5103  ax-un 7182
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2062  df-mo 2635  df-eu 2638  df-clab 2800  df-cleq 2806  df-clel 2809  df-nfc 2944  df-ne 2986  df-ral 3108  df-rex 3109  df-reu 3110  df-rab 3112  df-v 3400  df-sbc 3641  df-csb 3736  df-dif 3779  df-un 3781  df-in 3783  df-ss 3790  df-nul 4124  df-if 4287  df-pw 4360  df-sn 4378  df-pr 4380  df-op 4384  df-uni 4638  df-iun 4721  df-iin 4722  df-br 4852  df-opab 4914  df-mpt 4931  df-id 5226  df-xp 5324  df-rel 5325  df-cnv 5326  df-co 5327  df-dm 5328  df-rn 5329  df-res 5330  df-ima 5331  df-iota 6067  df-fun 6106  df-fn 6107  df-f 6108  df-f1 6109  df-fo 6110  df-f1o 6111  df-fv 6112  df-riota 6838  df-ov 6880  df-oprab 6881  df-mpt2 6882  df-1st 7401  df-2nd 7402  df-proset 17136  df-poset 17154  df-plt 17166  df-lub 17182  df-glb 17183  df-join 17184  df-meet 17185  df-p0 17247  df-p1 17248  df-lat 17254  df-clat 17316  df-oposet 34958  df-ol 34960  df-oml 34961  df-covers 35048  df-ats 35049  df-atl 35080  df-cvlat 35104  df-hlat 35133  df-psubsp 35285  df-pmap 35286  df-padd 35578  df-lhyp 35770
This theorem is referenced by:  cdleme11c  36043  cdlemg4b1  36391  cdlemg4g  36398  cdlemg13a  36433  cdlemg17a  36443  cdlemg17f  36448  cdlemg18b  36461  cdlemg18c  36462
  Copyright terms: Public domain W3C validator