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 34931
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 1078 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → 𝐾 ∈ HL)
2 simp1r 1079 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → 𝑊𝐻)
3 simp2r 1081 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝑋𝐵 ∧ ¬ 𝑋 𝑊))
4 cdlemg7.b . . . 4 𝐵 = (Base‘𝐾)
5 cdlemg7.l . . . 4 = (le‘𝐾)
6 eqid 2610 . . . 4 (join‘𝐾) = (join‘𝐾)
7 eqid 2610 . . . 4 (meet‘𝐾) = (meet‘𝐾)
8 cdlemg7.a . . . 4 𝐴 = (Atoms‘𝐾)
9 cdlemg7.h . . . 4 𝐻 = (LHyp‘𝐾)
104, 5, 6, 7, 8, 9lhpmcvr2 34328 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) → ∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋))
111, 2, 3, 10syl21anc 1317 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → ∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋))
12 simp11 1084 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
13 simp2 1055 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝑟𝐴)
14 simp3l 1082 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → ¬ 𝑟 𝑊)
1513, 14jca 553 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑟𝐴 ∧ ¬ 𝑟 𝑊))
16 simp12r 1168 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑋𝐵 ∧ ¬ 𝑋 𝑊))
17 simp131 1189 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝐹𝑇)
18 simp132 1190 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝐺𝑇)
19 simp3r 1083 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)
20 cdlemg7.t . . . . . 6 𝑇 = ((LTrn‘𝐾)‘𝑊)
214, 5, 6, 7, 8, 9, 20cdlemg7fvN 34930 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑟𝐴 ∧ ¬ 𝑟 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
2212, 15, 16, 17, 18, 19, 21syl123anc 1335 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
23 simp12l 1167 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
24 simp133 1191 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑃)) = 𝑃)
255, 8, 9, 20cdlemg6 34929 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑟𝐴 ∧ ¬ 𝑟 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝐹‘(𝐺𝑟)) = 𝑟)
2612, 23, 15, 17, 18, 24, 25syl123anc 1335 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑟)) = 𝑟)
2726oveq1d 6564 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
2822, 27, 193eqtrd 2648 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = 𝑋)
2928rexlimdv3a 3015 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋) → (𝐹‘(𝐺𝑋)) = 𝑋))
3011, 29mpd 15 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝐹‘(𝐺𝑋)) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  w3a 1031   = wceq 1475  wcel 1977  wrex 2897   class class class wbr 4583  cfv 5804  (class class class)co 6549  Basecbs 15695  lecple 15775  joincjn 16767  meetcmee 16768  Atomscatm 33568  HLchlt 33655  LHypclh 34288  LTrncltrn 34405
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-riotaBAD 33257
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-iin 4458  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-undef 7286  df-map 7746  df-preset 16751  df-poset 16769  df-plt 16781  df-lub 16797  df-glb 16798  df-join 16799  df-meet 16800  df-p0 16862  df-p1 16863  df-lat 16869  df-clat 16931  df-oposet 33481  df-ol 33483  df-oml 33484  df-covers 33571  df-ats 33572  df-atl 33603  df-cvlat 33627  df-hlat 33656  df-llines 33802  df-lplanes 33803  df-lvols 33804  df-lines 33805  df-psubsp 33807  df-pmap 33808  df-padd 34100  df-lhyp 34292  df-laut 34293  df-ldil 34408  df-ltrn 34409  df-trl 34464
This theorem is referenced by:  cdlemg7N  34932
  Copyright terms: Public domain W3C validator