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

Theorem ltrniotacl 36254
Description: Version of cdleme50ltrn 36232 with simpler hypotheses. TODO: Fix comment. (Contributed by NM, 17-Apr-2013.)
Hypotheses
Ref Expression
ltrniotaval.l = (le‘𝐾)
ltrniotaval.a 𝐴 = (Atoms‘𝐾)
ltrniotaval.h 𝐻 = (LHyp‘𝐾)
ltrniotaval.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
ltrniotaval.f 𝐹 = (𝑓𝑇 (𝑓𝑃) = 𝑄)
Assertion
Ref Expression
ltrniotacl (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝐹𝑇)
Distinct variable groups:   𝐴,𝑓   𝑓,𝐻   𝑓,𝐾   ,𝑓   𝑃,𝑓   𝑄,𝑓   𝑇,𝑓   𝑓,𝑊
Allowed substitution hint:   𝐹(𝑓)

Proof of Theorem ltrniotacl
Dummy variables 𝑠 𝑡 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2692 . 2 (Base‘𝐾) = (Base‘𝐾)
2 ltrniotaval.l . 2 = (le‘𝐾)
3 eqid 2692 . 2 (join‘𝐾) = (join‘𝐾)
4 eqid 2692 . 2 (meet‘𝐾) = (meet‘𝐾)
5 ltrniotaval.a . 2 𝐴 = (Atoms‘𝐾)
6 ltrniotaval.h . 2 𝐻 = (LHyp‘𝐾)
7 eqid 2692 . 2 ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊) = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊)
8 eqid 2692 . 2 ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊))) = ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))
9 eqid 2692 . 2 ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)(((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))(join‘𝐾)((𝑠(join‘𝐾)𝑡)(meet‘𝐾)𝑊))) = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)(((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))(join‘𝐾)((𝑠(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))
10 eqid 2692 . 2 (𝑥 ∈ (Base‘𝐾) ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), (𝑧 ∈ (Base‘𝐾)∀𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠(join‘𝐾)(𝑥(meet‘𝐾)𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑃(join‘𝐾)𝑄), (𝑦 ∈ (Base‘𝐾)∀𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃(join‘𝐾)𝑄)) → 𝑦 = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)(((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))(join‘𝐾)((𝑠(join‘𝐾)𝑡)(meet‘𝐾)𝑊))))), 𝑠 / 𝑡((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊))))(join‘𝐾)(𝑥(meet‘𝐾)𝑊)))), 𝑥)) = (𝑥 ∈ (Base‘𝐾) ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), (𝑧 ∈ (Base‘𝐾)∀𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠(join‘𝐾)(𝑥(meet‘𝐾)𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑃(join‘𝐾)𝑄), (𝑦 ∈ (Base‘𝐾)∀𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃(join‘𝐾)𝑄)) → 𝑦 = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)(((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))(join‘𝐾)((𝑠(join‘𝐾)𝑡)(meet‘𝐾)𝑊))))), 𝑠 / 𝑡((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊))))(join‘𝐾)(𝑥(meet‘𝐾)𝑊)))), 𝑥))
11 ltrniotaval.t . 2 𝑇 = ((LTrn‘𝐾)‘𝑊)
12 ltrniotaval.f . 2 𝐹 = (𝑓𝑇 (𝑓𝑃) = 𝑄)
131, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12cdlemg1ltrnlem 36249 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝐹𝑇)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  w3a 1072   = wceq 1564  wcel 2071  wne 2864  wral 2982  csb 3607  ifcif 4162   class class class wbr 4728  cmpt 4805  cfv 5969  crio 6693  (class class class)co 6733  Basecbs 15948  lecple 16039  joincjn 17034  meetcmee 17035  Atomscatm 34938  HLchlt 35025  LHypclh 35658  LTrncltrn 35775
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1818  ax-5 1920  ax-6 1986  ax-7 2022  ax-8 2073  ax-9 2080  ax-10 2100  ax-11 2115  ax-12 2128  ax-13 2323  ax-ext 2672  ax-rep 4847  ax-sep 4857  ax-nul 4865  ax-pow 4916  ax-pr 4979  ax-un 7034  ax-riotaBAD 34627
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1567  df-ex 1786  df-nf 1791  df-sb 1979  df-eu 2543  df-mo 2544  df-clab 2679  df-cleq 2685  df-clel 2688  df-nfc 2823  df-ne 2865  df-nel 2968  df-ral 2987  df-rex 2988  df-reu 2989  df-rmo 2990  df-rab 2991  df-v 3274  df-sbc 3510  df-csb 3608  df-dif 3651  df-un 3653  df-in 3655  df-ss 3662  df-nul 3992  df-if 4163  df-pw 4236  df-sn 4254  df-pr 4256  df-op 4260  df-uni 4513  df-iun 4598  df-iin 4599  df-br 4729  df-opab 4789  df-mpt 4806  df-id 5096  df-xp 5192  df-rel 5193  df-cnv 5194  df-co 5195  df-dm 5196  df-rn 5197  df-res 5198  df-ima 5199  df-iota 5932  df-fun 5971  df-fn 5972  df-f 5973  df-f1 5974  df-fo 5975  df-f1o 5976  df-fv 5977  df-riota 6694  df-ov 6736  df-oprab 6737  df-mpt2 6738  df-1st 7253  df-2nd 7254  df-undef 7487  df-map 7944  df-preset 17018  df-poset 17036  df-plt 17048  df-lub 17064  df-glb 17065  df-join 17066  df-meet 17067  df-p0 17129  df-p1 17130  df-lat 17136  df-clat 17198  df-oposet 34851  df-ol 34853  df-oml 34854  df-covers 34941  df-ats 34942  df-atl 34973  df-cvlat 34997  df-hlat 35026  df-llines 35172  df-lplanes 35173  df-lvols 35174  df-lines 35175  df-psubsp 35177  df-pmap 35178  df-padd 35470  df-lhyp 35662  df-laut 35663  df-ldil 35778  df-ltrn 35779  df-trl 35834
This theorem is referenced by:  ltrniotacnvval  36257  ltrniotaidvalN  36258  ltrniotavalbN  36259  cdlemg1ci2  36261  cdlemki  36516  cdlemkj  36538  cdlemm10N  36794  dicssdvh  36862  dicvaddcl  36866  dicvscacl  36867  dicn0  36868  diclspsn  36870  cdlemn2  36871  cdlemn2a  36872  cdlemn3  36873  cdlemn4  36874  cdlemn4a  36875  cdlemn6  36878  cdlemn8  36880  cdlemn9  36881  cdlemn11a  36883  dihordlem7b  36891  dihopelvalcpre  36924  dih1  36962  dihmeetlem1N  36966  dihglblem5apreN  36967  dihglbcpreN  36976  dihmeetlem4preN  36982  dihmeetlem13N  36995  dih1dimatlem0  37004  dihatlat  37010  dihatexv  37014  dihjatcclem3  37096  dihjatcclem4  37097
  Copyright terms: Public domain W3C validator