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

Theorem cdleme50lebi 40945
Description: Part of proof of Lemma D in [Crawley] p. 113. TODO: fix comment. (Contributed by NM, 9-Apr-2013.)
Hypotheses
Ref Expression
cdlemef50.b 𝐵 = (Base‘𝐾)
cdlemef50.l = (le‘𝐾)
cdlemef50.j = (join‘𝐾)
cdlemef50.m = (meet‘𝐾)
cdlemef50.a 𝐴 = (Atoms‘𝐾)
cdlemef50.h 𝐻 = (LHyp‘𝐾)
cdlemef50.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdlemef50.d 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
cdlemefs50.e 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
cdlemef50.f 𝐹 = (𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))), 𝑥))
Assertion
Ref Expression
cdleme50lebi ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵)) → (𝑋 𝑌 ↔ (𝐹𝑋) (𝐹𝑌)))
Distinct variable groups:   𝑡,𝑠,𝑥,𝑦,𝑧,   ,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐴,𝑠,𝑡,𝑥,𝑦,𝑧   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝐷,𝑠,𝑥,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝐻,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡,𝑥,𝑦,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   𝑋,𝑠,𝑡,𝑥,𝑦,𝑧   𝑌,𝑠,𝑡,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐷(𝑡)   𝐸(𝑡,𝑠)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)

Proof of Theorem cdleme50lebi
Dummy variables 𝑎 𝑏 𝑐 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cdlemef50.b . 2 𝐵 = (Base‘𝐾)
2 cdlemef50.l . 2 = (le‘𝐾)
3 cdlemef50.j . 2 = (join‘𝐾)
4 cdlemef50.m . 2 = (meet‘𝐾)
5 cdlemef50.a . 2 𝐴 = (Atoms‘𝐾)
6 cdlemef50.h . 2 𝐻 = (LHyp‘𝐾)
7 cdlemef50.u . 2 𝑈 = ((𝑃 𝑄) 𝑊)
8 cdlemef50.d . 2 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
9 cdlemefs50.e . 2 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
10 cdlemef50.f . 2 𝐹 = (𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))), 𝑥))
11 eqid 2737 . 2 ((𝑄 𝑃) 𝑊) = ((𝑄 𝑃) 𝑊)
12 eqid 2737 . 2 ((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) = ((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊)))
13 eqid 2737 . 2 ((𝑄 𝑃) (((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) ((𝑢 𝑣) 𝑊))) = ((𝑄 𝑃) (((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) ((𝑢 𝑣) 𝑊)))
14 eqid 2737 . 2 (𝑎𝐵 ↦ if((𝑄𝑃 ∧ ¬ 𝑎 𝑊), (𝑐𝐵𝑢𝐴 ((¬ 𝑢 𝑊 ∧ (𝑢 (𝑎 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 (𝑄 𝑃), (𝑏𝐵𝑣𝐴 ((¬ 𝑣 𝑊 ∧ ¬ 𝑣 (𝑄 𝑃)) → 𝑏 = ((𝑄 𝑃) (((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) ((𝑢 𝑣) 𝑊))))), 𝑢 / 𝑣((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊)))) (𝑎 𝑊)))), 𝑎)) = (𝑎𝐵 ↦ if((𝑄𝑃 ∧ ¬ 𝑎 𝑊), (𝑐𝐵𝑢𝐴 ((¬ 𝑢 𝑊 ∧ (𝑢 (𝑎 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 (𝑄 𝑃), (𝑏𝐵𝑣𝐴 ((¬ 𝑣 𝑊 ∧ ¬ 𝑣 (𝑄 𝑃)) → 𝑏 = ((𝑄 𝑃) (((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) ((𝑢 𝑣) 𝑊))))), 𝑢 / 𝑣((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊)))) (𝑎 𝑊)))), 𝑎))
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14cdlemeg49lebilem 40944 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵)) → (𝑋 𝑌 ↔ (𝐹𝑋) (𝐹𝑌)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wne 2933  wral 3052  csb 3851  ifcif 4481   class class class wbr 5100  cmpt 5181  cfv 6502  crio 7326  (class class class)co 7370  Basecbs 17150  lecple 17198  joincjn 18248  meetcmee 18249  Atomscatm 39668  HLchlt 39755  LHypclh 40389
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692  ax-riotaBAD 39358
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-iin 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-riota 7327  df-ov 7373  df-oprab 7374  df-mpo 7375  df-1st 7945  df-2nd 7946  df-undef 8227  df-proset 18231  df-poset 18250  df-plt 18265  df-lub 18281  df-glb 18282  df-join 18283  df-meet 18284  df-p0 18360  df-p1 18361  df-lat 18369  df-clat 18436  df-oposet 39581  df-ol 39583  df-oml 39584  df-covers 39671  df-ats 39672  df-atl 39703  df-cvlat 39727  df-hlat 39756  df-llines 39903  df-lplanes 39904  df-lvols 39905  df-lines 39906  df-psubsp 39908  df-pmap 39909  df-padd 40201  df-lhyp 40393
This theorem is referenced by:  cdleme50eq  40946  cdleme50laut  40952
  Copyright terms: Public domain W3C validator