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 39319
Description: Version of cdleme50ltrn 39297 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 2732 . 2 (Base‘𝐾) = (Base‘𝐾)
2 ltrniotaval.l . 2 = (le‘𝐾)
3 eqid 2732 . 2 (join‘𝐾) = (join‘𝐾)
4 eqid 2732 . 2 (meet‘𝐾) = (meet‘𝐾)
5 ltrniotaval.a . 2 𝐴 = (Atoms‘𝐾)
6 ltrniotaval.h . 2 𝐻 = (LHyp‘𝐾)
7 eqid 2732 . 2 ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊) = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊)
8 eqid 2732 . 2 ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊))) = ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))
9 eqid 2732 . 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 2732 . 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 39314 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝐹𝑇)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  wne 2940  wral 3061  csb 3890  ifcif 4523   class class class wbr 5142  cmpt 5225  cfv 6533  crio 7349  (class class class)co 7394  Basecbs 17128  lecple 17188  joincjn 18248  meetcmee 18249  Atomscatm 38002  HLchlt 38089  LHypclh 38724  LTrncltrn 38841
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5279  ax-sep 5293  ax-nul 5300  ax-pow 5357  ax-pr 5421  ax-un 7709  ax-riotaBAD 37692
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3775  df-csb 3891  df-dif 3948  df-un 3950  df-in 3952  df-ss 3962  df-nul 4320  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-iun 4993  df-iin 4994  df-br 5143  df-opab 5205  df-mpt 5226  df-id 5568  df-xp 5676  df-rel 5677  df-cnv 5678  df-co 5679  df-dm 5680  df-rn 5681  df-res 5682  df-ima 5683  df-iota 6485  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7350  df-ov 7397  df-oprab 7398  df-mpo 7399  df-1st 7959  df-2nd 7960  df-undef 8242  df-map 8807  df-proset 18232  df-poset 18250  df-plt 18267  df-lub 18283  df-glb 18284  df-join 18285  df-meet 18286  df-p0 18362  df-p1 18363  df-lat 18369  df-clat 18436  df-oposet 37915  df-ol 37917  df-oml 37918  df-covers 38005  df-ats 38006  df-atl 38037  df-cvlat 38061  df-hlat 38090  df-llines 38238  df-lplanes 38239  df-lvols 38240  df-lines 38241  df-psubsp 38243  df-pmap 38244  df-padd 38536  df-lhyp 38728  df-laut 38729  df-ldil 38844  df-ltrn 38845  df-trl 38899
This theorem is referenced by:  ltrniotacnvval  39322  ltrniotaidvalN  39323  ltrniotavalbN  39324  cdlemg1ci2  39326  cdlemki  39581  cdlemkj  39603  cdlemm10N  39858  dicssdvh  39926  dicvaddcl  39930  dicvscacl  39931  dicn0  39932  diclspsn  39934  cdlemn2  39935  cdlemn2a  39936  cdlemn3  39937  cdlemn4  39938  cdlemn4a  39939  cdlemn6  39942  cdlemn8  39944  cdlemn9  39945  cdlemn11a  39947  dihordlem7b  39955  dihopelvalcpre  39988  dih1  40026  dihmeetlem1N  40030  dihglblem5apreN  40031  dihglbcpreN  40040  dihmeetlem4preN  40046  dihmeetlem13N  40059  dih1dimatlem0  40068  dihatlat  40074  dihatexv  40078  dihjatcclem3  40160  dihjatcclem4  40161
  Copyright terms: Public domain W3C validator