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 38860
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 1196 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → 𝐾 ∈ HL)
2 simp1r 1197 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → 𝑊𝐻)
3 simp2r 1199 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝑋𝐵 ∧ ¬ 𝑋 𝑊))
4 cdlemg7.b . . . 4 𝐵 = (Base‘𝐾)
5 cdlemg7.l . . . 4 = (le‘𝐾)
6 eqid 2737 . . . 4 (join‘𝐾) = (join‘𝐾)
7 eqid 2737 . . . 4 (meet‘𝐾) = (meet‘𝐾)
8 cdlemg7.a . . . 4 𝐴 = (Atoms‘𝐾)
9 cdlemg7.h . . . 4 𝐻 = (LHyp‘𝐾)
104, 5, 6, 7, 8, 9lhpmcvr2 38259 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) → ∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋))
111, 2, 3, 10syl21anc 835 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → ∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋))
12 simp11 1202 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
13 simp2 1136 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝑟𝐴)
14 simp3l 1200 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → ¬ 𝑟 𝑊)
1513, 14jca 512 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑟𝐴 ∧ ¬ 𝑟 𝑊))
16 simp12r 1286 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑋𝐵 ∧ ¬ 𝑋 𝑊))
17 simp131 1307 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝐹𝑇)
18 simp132 1308 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → 𝐺𝑇)
19 simp3r 1201 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)
20 cdlemg7.t . . . . . 6 𝑇 = ((LTrn‘𝐾)‘𝑊)
214, 5, 6, 7, 8, 9, 20cdlemg7fvN 38859 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑟𝐴 ∧ ¬ 𝑟 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
2212, 15, 16, 17, 18, 19, 21syl123anc 1386 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
23 simp12l 1285 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
24 simp133 1309 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑃)) = 𝑃)
255, 8, 9, 20cdlemg6 38858 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑟𝐴 ∧ ¬ 𝑟 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝐹‘(𝐺𝑟)) = 𝑟)
2612, 23, 15, 17, 18, 24, 25syl123anc 1386 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑟)) = 𝑟)
2726oveq1d 7332 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → ((𝐹‘(𝐺𝑟))(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)))
2822, 27, 193eqtrd 2781 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋)) → (𝐹‘(𝐺𝑋)) = 𝑋)
2928rexlimdv3a 3153 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (∃𝑟𝐴𝑟 𝑊 ∧ (𝑟(join‘𝐾)(𝑋(meet‘𝐾)𝑊)) = 𝑋) → (𝐹‘(𝐺𝑋)) = 𝑋))
3011, 29mpd 15 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) ∧ (𝐹𝑇𝐺𝑇 ∧ (𝐹‘(𝐺𝑃)) = 𝑃)) → (𝐹‘(𝐺𝑋)) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1086   = wceq 1540  wcel 2105  wrex 3071   class class class wbr 5087  cfv 6466  (class class class)co 7317  Basecbs 16989  lecple 17046  joincjn 18106  meetcmee 18107  Atomscatm 37497  HLchlt 37584  LHypclh 38219  LTrncltrn 38336
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2708  ax-rep 5224  ax-sep 5238  ax-nul 5245  ax-pow 5303  ax-pr 5367  ax-un 7630  ax-riotaBAD 37187
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3350  df-reu 3351  df-rab 3405  df-v 3443  df-sbc 3727  df-csb 3843  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4268  df-if 4472  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4851  df-iun 4939  df-iin 4940  df-br 5088  df-opab 5150  df-mpt 5171  df-id 5507  df-xp 5614  df-rel 5615  df-cnv 5616  df-co 5617  df-dm 5618  df-rn 5619  df-res 5620  df-ima 5621  df-iota 6418  df-fun 6468  df-fn 6469  df-f 6470  df-f1 6471  df-fo 6472  df-f1o 6473  df-fv 6474  df-riota 7274  df-ov 7320  df-oprab 7321  df-mpo 7322  df-1st 7878  df-2nd 7879  df-undef 8138  df-map 8667  df-proset 18090  df-poset 18108  df-plt 18125  df-lub 18141  df-glb 18142  df-join 18143  df-meet 18144  df-p0 18220  df-p1 18221  df-lat 18227  df-clat 18294  df-oposet 37410  df-ol 37412  df-oml 37413  df-covers 37500  df-ats 37501  df-atl 37532  df-cvlat 37556  df-hlat 37585  df-llines 37733  df-lplanes 37734  df-lvols 37735  df-lines 37736  df-psubsp 37738  df-pmap 37739  df-padd 38031  df-lhyp 38223  df-laut 38224  df-ldil 38339  df-ltrn 38340  df-trl 38394
This theorem is referenced by:  cdlemg7N  38861
  Copyright terms: Public domain W3C validator