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 40824
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 1198 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → 𝐾 ∈ HL)
2 simp1r 1199 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → 𝑊𝐻)
3 simp2r 1201 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝑋𝐵 ∧ ¬ 𝑋 𝑊))
4 cdlemg7.b . . . 4 𝐵 = (Base‘𝐾)
5 cdlemg7.l . . . 4 = (le‘𝐾)
6 eqid 2734 . . . 4 (join‘𝐾) = (join‘𝐾)
7 eqid 2734 . . . 4 (meet‘𝐾) = (meet‘𝐾)
8 cdlemg7.a . . . 4 𝐴 = (Atoms‘𝐾)
9 cdlemg7.h . . . 4 𝐻 = (LHyp‘𝐾)
104, 5, 6, 7, 8, 9lhpmcvr2 40223 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) → ∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋))
111, 2, 3, 10syl21anc 837 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → ∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋))
12 simp11 1204 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
13 simp2 1137 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝑟𝐴)
14 simp3l 1202 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → ¬ 𝑟 𝑊)
1513, 14jca 511 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑟𝐴 ∧ ¬ 𝑟 𝑊))
16 simp12r 1288 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑋𝐵 ∧ ¬ 𝑋 𝑊))
17 simp131 1309 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝐹𝑇)
18 simp132 1310 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝐺𝑇)
19 simp3r 1203 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)
20 cdlemg7.t . . . . . 6 𝑇 = ((LTrn‘𝐾)‘𝑊)
214, 5, 6, 7, 8, 9, 20cdlemg7fvN 40823 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑟𝐴 ∧ ¬ 𝑟 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
2212, 15, 16, 17, 18, 19, 21syl123anc 1389 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
23 simp12l 1287 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
24 simp133 1311 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑃)) = 𝑃)
255, 8, 9, 20cdlemg6 40822 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑟𝐴 ∧ ¬ 𝑟 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝐹‘(𝐺𝑟)) = 𝑟)
2612, 23, 15, 17, 18, 24, 25syl123anc 1389 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑟)) = 𝑟)
2726oveq1d 7371 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
2822, 27, 193eqtrd 2773 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = 𝑋)
2928rexlimdv3a 3139 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋) → (𝐹‘(𝐺𝑋)) = 𝑋))
3011, 29mpd 15 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝐹‘(𝐺𝑋)) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1086   = wceq 1541  wcel 2113  wrex 3058   class class class wbr 5096  cfv 6490  (class class class)co 7356  Basecbs 17134  lecple 17182  joincjn 18232  meetcmee 18233  Atomscatm 39462  HLchlt 39549  LHypclh 40183  LTrncltrn 40300
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678  ax-riotaBAD 39152
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-iin 4947  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-undef 8213  df-map 8763  df-proset 18215  df-poset 18234  df-plt 18249  df-lub 18265  df-glb 18266  df-join 18267  df-meet 18268  df-p0 18344  df-p1 18345  df-lat 18353  df-clat 18420  df-oposet 39375  df-ol 39377  df-oml 39378  df-covers 39465  df-ats 39466  df-atl 39497  df-cvlat 39521  df-hlat 39550  df-llines 39697  df-lplanes 39698  df-lvols 39699  df-lines 39700  df-psubsp 39702  df-pmap 39703  df-padd 39995  df-lhyp 40187  df-laut 40188  df-ldil 40303  df-ltrn 40304  df-trl 40358
This theorem is referenced by:  cdlemg7N  40825
  Copyright terms: Public domain W3C validator