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

Theorem cdlemg7aN 36427
Description: TODO: FIX COMMENT. (Contributed by NM, 28-Apr-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdlemg7.b 𝐵 = (Base‘𝐾)
cdlemg7.l = (le‘𝐾)
cdlemg7.a 𝐴 = (Atoms‘𝐾)
cdlemg7.h 𝐻 = (LHyp‘𝐾)
cdlemg7.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
Assertion
Ref Expression
cdlemg7aN (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝐹‘(𝐺𝑋)) = 𝑋)

Proof of Theorem cdlemg7aN
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 simp1l 1238 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → 𝐾 ∈ HL)
2 simp1r 1239 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → 𝑊𝐻)
3 simp2r 1241 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝑋𝐵 ∧ ¬ 𝑋 𝑊))
4 cdlemg7.b . . . 4 𝐵 = (Base‘𝐾)
5 cdlemg7.l . . . 4 = (le‘𝐾)
6 eqid 2770 . . . 4 (join‘𝐾) = (join‘𝐾)
7 eqid 2770 . . . 4 (meet‘𝐾) = (meet‘𝐾)
8 cdlemg7.a . . . 4 𝐴 = (Atoms‘𝐾)
9 cdlemg7.h . . . 4 𝐻 = (LHyp‘𝐾)
104, 5, 6, 7, 8, 9lhpmcvr2 35825 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) → ∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋))
111, 2, 3, 10syl21anc 1474 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → ∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋))
12 simp11 1244 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
13 simp2 1130 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝑟𝐴)
14 simp3l 1242 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → ¬ 𝑟 𝑊)
1513, 14jca 495 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑟𝐴 ∧ ¬ 𝑟 𝑊))
16 simp12r 1370 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑋𝐵 ∧ ¬ 𝑋 𝑊))
17 simp131 1391 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝐹𝑇)
18 simp132 1392 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝐺𝑇)
19 simp3r 1243 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)
20 cdlemg7.t . . . . . 6 𝑇 = ((LTrn‘𝐾)‘𝑊)
214, 5, 6, 7, 8, 9, 20cdlemg7fvN 36426 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑟𝐴 ∧ ¬ 𝑟 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
2212, 15, 16, 17, 18, 19, 21syl123anc 1492 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
23 simp12l 1369 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
24 simp133 1393 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑃)) = 𝑃)
255, 8, 9, 20cdlemg6 36425 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑟𝐴 ∧ ¬ 𝑟 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝐹‘(𝐺𝑟)) = 𝑟)
2612, 23, 15, 17, 18, 24, 25syl123anc 1492 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑟)) = 𝑟)
2726oveq1d 6807 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
2822, 27, 193eqtrd 2808 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = 𝑋)
2928rexlimdv3a 3180 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋) → (𝐹‘(𝐺𝑋)) = 𝑋))
3011, 29mpd 15 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝐹‘(𝐺𝑋)) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 382  w3a 1070   = wceq 1630  wcel 2144  wrex 3061   class class class wbr 4784  cfv 6031  (class class class)co 6792  Basecbs 16063  lecple 16155  joincjn 17151  meetcmee 17152  Atomscatm 35065  HLchlt 35152  LHypclh 35785  LTrncltrn 35902
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-rep 4902  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095  ax-riotaBAD 34754
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3or 1071  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-nel 3046  df-ral 3065  df-rex 3066  df-reu 3067  df-rmo 3068  df-rab 3069  df-v 3351  df-sbc 3586  df-csb 3681  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-pw 4297  df-sn 4315  df-pr 4317  df-op 4321  df-uni 4573  df-iun 4654  df-iin 4655  df-br 4785  df-opab 4845  df-mpt 4862  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-riota 6753  df-ov 6795  df-oprab 6796  df-mpt2 6797  df-1st 7314  df-2nd 7315  df-undef 7550  df-map 8010  df-preset 17135  df-poset 17153  df-plt 17165  df-lub 17181  df-glb 17182  df-join 17183  df-meet 17184  df-p0 17246  df-p1 17247  df-lat 17253  df-clat 17315  df-oposet 34978  df-ol 34980  df-oml 34981  df-covers 35068  df-ats 35069  df-atl 35100  df-cvlat 35124  df-hlat 35153  df-llines 35299  df-lplanes 35300  df-lvols 35301  df-lines 35302  df-psubsp 35304  df-pmap 35305  df-padd 35597  df-lhyp 35789  df-laut 35790  df-ldil 35905  df-ltrn 35906  df-trl 35961
This theorem is referenced by:  cdlemg7N  36428
  Copyright terms: Public domain W3C validator