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 35333
Description: Version of cdleme50ltrn 35311 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 2626 . 2 (Base‘𝐾) = (Base‘𝐾)
2 ltrniotaval.l . 2 = (le‘𝐾)
3 eqid 2626 . 2 (join‘𝐾) = (join‘𝐾)
4 eqid 2626 . 2 (meet‘𝐾) = (meet‘𝐾)
5 ltrniotaval.a . 2 𝐴 = (Atoms‘𝐾)
6 ltrniotaval.h . 2 𝐻 = (LHyp‘𝐾)
7 eqid 2626 . 2 ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊) = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊)
8 eqid 2626 . 2 ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊))) = ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))
9 eqid 2626 . 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 2626 . 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 35328 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝐹𝑇)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  w3a 1036   = wceq 1480  wcel 1992  wne 2796  wral 2912  csb 3519  ifcif 4063   class class class wbr 4618  cmpt 4678  cfv 5850  crio 6565  (class class class)co 6605  Basecbs 15776  lecple 15864  joincjn 16860  meetcmee 16861  Atomscatm 34016  HLchlt 34103  LHypclh 34736  LTrncltrn 34853
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1841  ax-6 1890  ax-7 1937  ax-8 1994  ax-9 2001  ax-10 2021  ax-11 2036  ax-12 2049  ax-13 2250  ax-ext 2606  ax-rep 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6903  ax-riotaBAD 33705
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1883  df-eu 2478  df-mo 2479  df-clab 2613  df-cleq 2619  df-clel 2622  df-nfc 2756  df-ne 2797  df-nel 2900  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3193  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-iun 4492  df-iin 4493  df-br 4619  df-opab 4679  df-mpt 4680  df-id 4994  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-iota 5813  df-fun 5852  df-fn 5853  df-f 5854  df-f1 5855  df-fo 5856  df-f1o 5857  df-fv 5858  df-riota 6566  df-ov 6608  df-oprab 6609  df-mpt2 6610  df-1st 7116  df-2nd 7117  df-undef 7345  df-map 7805  df-preset 16844  df-poset 16862  df-plt 16874  df-lub 16890  df-glb 16891  df-join 16892  df-meet 16893  df-p0 16955  df-p1 16956  df-lat 16962  df-clat 17024  df-oposet 33929  df-ol 33931  df-oml 33932  df-covers 34019  df-ats 34020  df-atl 34051  df-cvlat 34075  df-hlat 34104  df-llines 34250  df-lplanes 34251  df-lvols 34252  df-lines 34253  df-psubsp 34255  df-pmap 34256  df-padd 34548  df-lhyp 34740  df-laut 34741  df-ldil 34856  df-ltrn 34857  df-trl 34912
This theorem is referenced by:  ltrniotacnvval  35336  ltrniotaidvalN  35337  ltrniotavalbN  35338  cdlemg1ci2  35340  cdlemki  35595  cdlemkj  35617  cdlemm10N  35873  dicssdvh  35941  dicvaddcl  35945  dicvscacl  35946  dicn0  35947  diclspsn  35949  cdlemn2  35950  cdlemn2a  35951  cdlemn3  35952  cdlemn4  35953  cdlemn4a  35954  cdlemn6  35957  cdlemn8  35959  cdlemn9  35960  cdlemn11a  35962  dihordlem7b  35970  dihopelvalcpre  36003  dih1  36041  dihmeetlem1N  36045  dihglblem5apreN  36046  dihglbcpreN  36055  dihmeetlem4preN  36061  dihmeetlem13N  36074  dih1dimatlem0  36083  dihatlat  36089  dihatexv  36093  dihjatcclem3  36175  dihjatcclem4  36176
  Copyright terms: Public domain W3C validator