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

Theorem cdleme50rn 40531
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
cdleme50rn (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ran 𝐹 = 𝐵)
Distinct variable groups:   𝑡,𝑠,𝑥,𝑦,𝑧,   ,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐴,𝑠,𝑡,𝑥,𝑦,𝑧   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝐷,𝑠,𝑥,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝐻,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡,𝑥,𝑦,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐷(𝑡)   𝐸(𝑡,𝑠)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)

Proof of Theorem cdleme50rn
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 2730 . 2 ((𝑄 𝑃) 𝑊) = ((𝑄 𝑃) 𝑊)
12 eqid 2730 . 2 ((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) = ((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊)))
13 eqid 2730 . 2 ((𝑄 𝑃) (((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) ((𝑢 𝑣) 𝑊))) = ((𝑄 𝑃) (((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) ((𝑢 𝑣) 𝑊)))
14 eqid 2730 . 2 (𝑎𝐵 ↦ if((𝑄𝑃 ∧ ¬ 𝑎 𝑊), (𝑐𝐵𝑢𝐴 ((¬ 𝑢 𝑊 ∧ (𝑢 (𝑎 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 (𝑄 𝑃), (𝑏𝐵𝑣𝐴 ((¬ 𝑣 𝑊 ∧ ¬ 𝑣 (𝑄 𝑃)) → 𝑏 = ((𝑄 𝑃) (((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) ((𝑢 𝑣) 𝑊))))), 𝑢 / 𝑣((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊)))) (𝑎 𝑊)))), 𝑎)) = (𝑎𝐵 ↦ if((𝑄𝑃 ∧ ¬ 𝑎 𝑊), (𝑐𝐵𝑢𝐴 ((¬ 𝑢 𝑊 ∧ (𝑢 (𝑎 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 (𝑄 𝑃), (𝑏𝐵𝑣𝐴 ((¬ 𝑣 𝑊 ∧ ¬ 𝑣 (𝑄 𝑃)) → 𝑏 = ((𝑄 𝑃) (((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊))) ((𝑢 𝑣) 𝑊))))), 𝑢 / 𝑣((𝑣 ((𝑄 𝑃) 𝑊)) (𝑃 ((𝑄 𝑣) 𝑊)))) (𝑎 𝑊)))), 𝑎))
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14cdleme50rnlem 40530 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ran 𝐹 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  wne 2927  wral 3046  csb 3870  ifcif 4496   class class class wbr 5115  cmpt 5196  ran crn 5647  cfv 6519  crio 7350  (class class class)co 7394  Basecbs 17185  lecple 17233  joincjn 18278  meetcmee 18279  Atomscatm 39248  HLchlt 39335  LHypclh 39970
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5242  ax-sep 5259  ax-nul 5269  ax-pow 5328  ax-pr 5395  ax-un 7718  ax-riotaBAD 38938
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2880  df-ne 2928  df-ral 3047  df-rex 3056  df-rmo 3357  df-reu 3358  df-rab 3412  df-v 3457  df-sbc 3762  df-csb 3871  df-dif 3925  df-un 3927  df-in 3929  df-ss 3939  df-nul 4305  df-if 4497  df-pw 4573  df-sn 4598  df-pr 4600  df-op 4604  df-uni 4880  df-iun 4965  df-iin 4966  df-br 5116  df-opab 5178  df-mpt 5197  df-id 5541  df-xp 5652  df-rel 5653  df-cnv 5654  df-co 5655  df-dm 5656  df-rn 5657  df-res 5658  df-ima 5659  df-iota 6472  df-fun 6521  df-fn 6522  df-f 6523  df-f1 6524  df-fo 6525  df-f1o 6526  df-fv 6527  df-riota 7351  df-ov 7397  df-oprab 7398  df-mpo 7399  df-1st 7977  df-2nd 7978  df-undef 8261  df-proset 18261  df-poset 18280  df-plt 18295  df-lub 18311  df-glb 18312  df-join 18313  df-meet 18314  df-p0 18390  df-p1 18391  df-lat 18397  df-clat 18464  df-oposet 39161  df-ol 39163  df-oml 39164  df-covers 39251  df-ats 39252  df-atl 39283  df-cvlat 39307  df-hlat 39336  df-llines 39484  df-lplanes 39485  df-lvols 39486  df-lines 39487  df-psubsp 39489  df-pmap 39490  df-padd 39782  df-lhyp 39974
This theorem is referenced by:  cdleme50f1o  40532
  Copyright terms: Public domain W3C validator