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

Theorem trljat1 41369
Description: The value of a translation of an atom 𝑃 not under the fiducial co-atom 𝑊, joined with trace. Equation above Lemma C in [Crawley] p. 112. TODO: shorten with atmod3i1 41067? (Contributed by NM, 22-May-2012.)
Hypotheses
Ref Expression
trljat.l ≤ = (le‘𝐾)
trljat.j ∨ = (join‘𝐾)
trljat.a 𝐴 = (Atoms‘𝐾)
trljat.h 𝐻 = (LHyp‘𝐾)
trljat.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
trljat.r 𝑅 = ((trL‘𝐾)‘𝑊)
Assertion
Ref Expression
trljat1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∨ (𝑅‘𝐹)) = (𝑃 ∨ (𝐹‘𝑃)))

Proof of Theorem trljat1
StepHypRef Expression
1 trljat.l . . . 4 ≤ = (le‘𝐾)
2 trljat.j . . . 4 ∨ = (join‘𝐾)
3 eqid 2763 . . . 4 (meet‘𝐾) = (meet‘𝐾)
4 trljat.a . . . 4 𝐴 = (Atoms‘𝐾)
5 trljat.h . . . 4 𝐻 = (LHyp‘𝐾)
6 trljat.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
7 trljat.r . . . 4 𝑅 = ((trL‘𝐾)‘𝑊)
81, 2, 3, 4, 5, 6, 7trlval2 41366 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐹) = ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)𝑊))
98oveq1d 7445 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑅‘𝐹) ∨ 𝑃) = (((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)𝑊) ∨ 𝑃))
10 simp1l 1216 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ HL)
1110hllatd 40567 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ Lat)
12 simp3l 1220 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴)
13 eqid 2763 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
1413, 4atbase 40492 . . . 4 (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
1512, 14syl 18 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ (Base‘𝐾))
1613, 5, 6, 7trlcl 41367 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘𝐹) ∈ (Base‘𝐾))
17163adant3 1150 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐹) ∈ (Base‘𝐾))
1813, 2latjcom 18636 . . 3 ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝑅‘𝐹) ∈ (Base‘𝐾)) → (𝑃 ∨ (𝑅‘𝐹)) = ((𝑅‘𝐹) ∨ 𝑃))
1911, 15, 17, 18syl3anc 1398 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∨ (𝑅‘𝐹)) = ((𝑅‘𝐹) ∨ 𝑃))
2013, 5, 6ltrncl 41328 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑃 ∈ (Base‘𝐾)) → (𝐹‘𝑃) ∈ (Base‘𝐾))
2115, 20syld3an3 1436 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐹‘𝑃) ∈ (Base‘𝐾))
2213, 2latjcl 18628 . . . . 5 ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝐹‘𝑃) ∈ (Base‘𝐾)) → (𝑃 ∨ (𝐹‘𝑃)) ∈ (Base‘𝐾))
2311, 15, 21, 22syl3anc 1398 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∨ (𝐹‘𝑃)) ∈ (Base‘𝐾))
24 simp1r 1217 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ 𝐻)
2513, 5lhpbase 41201 . . . . 5 (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
2624, 25syl 18 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ (Base‘𝐾))
2713, 1, 2latlej1 18637 . . . . 5 ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝐹‘𝑃) ∈ (Base‘𝐾)) → 𝑃 ≤ (𝑃 ∨ (𝐹‘𝑃)))
2811, 15, 21, 27syl3anc 1398 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ≤ (𝑃 ∨ (𝐹‘𝑃)))
2913, 1, 2, 3, 4atmod2i1 41064 . . . 4 ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ (𝑃 ∨ (𝐹‘𝑃)) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) ∧ 𝑃 ≤ (𝑃 ∨ (𝐹‘𝑃))) → (((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)𝑊) ∨ 𝑃) = ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)(𝑊 ∨ 𝑃)))
3010, 12, 23, 26, 28, 29syl131anc 1410 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)𝑊) ∨ 𝑃) = ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)(𝑊 ∨ 𝑃)))
31 eqid 2763 . . . . . 6 (1.‘𝐾) = (1.‘𝐾)
321, 2, 31, 4, 5lhpjat1 41223 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑊 ∨ 𝑃) = (1.‘𝐾))
33323adant2 1149 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑊 ∨ 𝑃) = (1.‘𝐾))
3433oveq2d 7446 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)(𝑊 ∨ 𝑃)) = ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)(1.‘𝐾)))
35 hlol 40564 . . . . 5 (𝐾 ∈ HL → 𝐾 ∈ OL)
3610, 35syl 18 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ OL)
3713, 3, 31olm11 40430 . . . 4 ((𝐾 ∈ OL ∧ (𝑃 ∨ (𝐹‘𝑃)) ∈ (Base‘𝐾)) → ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)(1.‘𝐾)) = (𝑃 ∨ (𝐹‘𝑃)))
3836, 23, 37syl2anc 596 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)(1.‘𝐾)) = (𝑃 ∨ (𝐹‘𝑃)))
3930, 34, 383eqtrrd 2803 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∨ (𝐹‘𝑃)) = (((𝑃 ∨ (𝐹‘𝑃))(meet‘𝐾)𝑊) ∨ 𝑃))
409, 19, 393eqtr4d 2808 1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∨ (𝑅‘𝐹)) = (𝑃 ∨ (𝐹‘𝑃)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146   class class class wbr 5106  ‘cfv 6547  (class class class)co 7430  Basecbs 17402  lecple 17450  joincjn 18500  meetcmee 18501  1.cp1 18611  Latclat 18620  OLcol 40377  Atomscatm 40466  HLchlt 40553  LHypclh 41187  LTrncltrn 41304  trLctrl 41361
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-1st 8011  df-2nd 8012  df-map 8863  df-proset 18483  df-poset 18502  df-plt 18517  df-lub 18533  df-glb 18534  df-join 18535  df-meet 18536  df-p0 18612  df-p1 18613  df-lat 18621  df-clat 18688  df-oposet 40379  df-ol 40381  df-oml 40382  df-covers 40469  df-ats 40470  df-atl 40501  df-cvlat 40525  df-hlat 40554  df-psubsp 40706  df-pmap 40707  df-padd 40999  df-lhyp 41191  df-laut 41192  df-ldil 41307  df-ltrn 41308  df-trl 41362
This theorem is used by:  trljat3  41371  trlval4  41391  trlval5  41392  cdlemc5  41398  cdlemk1  42034  cdlemk8  42041  cdlemki  42044  cdlemksv2  42050  cdlemk7  42051  cdlemk12  42053  cdlemk15  42058  cdlemk7u  42073  cdlemk12u  42075  cdlemk21N  42076  cdlemk20  42077  cdlemk22  42096  cdlemm10N  42321
  Copyright terms: Public domain W3C validator