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 41242
Description: Version of cdleme50ltrn 41220 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 2769 . 2 (Base‘𝐾) = (Base‘𝐾)
2 ltrniotaval.l . 2 = (le‘𝐾)
3 eqid 2769 . 2 (join‘𝐾) = (join‘𝐾)
4 eqid 2769 . 2 (meet‘𝐾) = (meet‘𝐾)
5 ltrniotaval.a . 2 𝐴 = (Atoms‘𝐾)
6 ltrniotaval.h . 2 𝐻 = (LHyp‘𝐾)
7 eqid 2769 . 2 ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊) = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊)
8 eqid 2769 . 2 ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊))) = ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))
9 eqid 2769 . 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 2769 . 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 41237 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝐹𝑇)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  w3a 1101   = wceq 1567  wcel 2149  wne 2964  wral 3085  csb 3861  ifcif 4492   class class class wbr 5113  cmpt 5196  cfv 6537  crio 7367  (class class class)co 7411  Basecbs 17268  lecple 17316  joincjn 18366  meetcmee 18367  Atomscatm 39926  HLchlt 40013  LHypclh 40647  LTrncltrn 40764
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-riotaBAD 39616
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-iin 4963  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7985  df-2nd 7986  df-undef 8268  df-map 8825  df-proset 18349  df-poset 18368  df-plt 18383  df-lub 18399  df-glb 18400  df-join 18401  df-meet 18402  df-p0 18478  df-p1 18479  df-lat 18487  df-clat 18554  df-oposet 39839  df-ol 39841  df-oml 39842  df-covers 39929  df-ats 39930  df-atl 39961  df-cvlat 39985  df-hlat 40014  df-llines 40161  df-lplanes 40162  df-lvols 40163  df-lines 40164  df-psubsp 40166  df-pmap 40167  df-padd 40459  df-lhyp 40651  df-laut 40652  df-ldil 40767  df-ltrn 40768  df-trl 40822
This theorem is referenced by:  ltrniotacnvval  41245  ltrniotaidvalN  41246  ltrniotavalbN  41247  cdlemg1ci2  41249  cdlemki  41504  cdlemkj  41526  cdlemm10N  41781  dicssdvh  41849  dicvaddcl  41853  dicvscacl  41854  dicn0  41855  diclspsn  41857  cdlemn2  41858  cdlemn2a  41859  cdlemn3  41860  cdlemn4  41861  cdlemn4a  41862  cdlemn6  41865  cdlemn8  41867  cdlemn9  41868  cdlemn11a  41870  dihordlem7b  41878  dihopelvalcpre  41911  dih1  41949  dihmeetlem1N  41953  dihglblem5apreN  41954  dihglbcpreN  41963  dihmeetlem4preN  41969  dihmeetlem13N  41982  dih1dimatlem0  41991  dihatlat  41997  dihatexv  42001  dihjatcclem3  42083  dihjatcclem4  42084
  Copyright terms: Public domain W3C validator