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

Theorem cdleme50rnlem 37716
Description: Part of proof of Lemma D in [Crawley] p. 113. TODO: fix comment. TODO: can we get rid of 𝐺 stuff if we show 𝐺 = 𝐹 earlier? (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(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))), 𝑥))
cdlemef50.v 𝑉 = ((𝑄 𝑃) 𝑊)
cdlemef50.n 𝑁 = ((𝑣 𝑉) (𝑃 ((𝑄 𝑣) 𝑊)))
cdlemefs50.o 𝑂 = ((𝑄 𝑃) (𝑁 ((𝑢 𝑣) 𝑊)))
cdlemef50.g 𝐺 = (𝑎𝐵 ↦ if((𝑄𝑃 ∧ ¬ 𝑎 𝑊), (𝑐𝐵𝑢𝐴 ((¬ 𝑢 𝑊 ∧ (𝑢 (𝑎 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 (𝑄 𝑃), (𝑏𝐵𝑣𝐴 ((¬ 𝑣 𝑊 ∧ ¬ 𝑣 (𝑄 𝑃)) → 𝑏 = 𝑂)), 𝑢 / 𝑣𝑁) (𝑎 𝑊)))), 𝑎))
Assertion
Ref Expression
cdleme50rnlem (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ran 𝐹 = 𝐵)
Distinct variable groups:   𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧,   ,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   ,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐴,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐵,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐷,𝑎,𝑏,𝑐,𝑠,𝑣,𝑥,𝑦,𝑧   𝐸,𝑎,𝑏,𝑐,𝑥,𝑦,𝑧   𝐹,𝑎,𝑏,𝑐,𝑢,𝑣   𝐻,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐾,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝑃,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝑄,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝑈,𝑎,𝑏,𝑐,𝑠,𝑡,𝑣,𝑥,𝑦,𝑧   𝑊,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐺,𝑠,𝑡,𝑥,𝑦,𝑧   𝑁,𝑎,𝑏,𝑐,𝑡,𝑢,𝑥,𝑦,𝑧   𝑂,𝑎,𝑏,𝑐,𝑥,𝑦,𝑧   𝑉,𝑎,𝑏,𝑐,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐷(𝑢,𝑡)   𝑈(𝑢)   𝐸(𝑣,𝑢,𝑡,𝑠)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐺(𝑣,𝑢,𝑎,𝑏,𝑐)   𝑁(𝑣,𝑠)   𝑂(𝑣,𝑢,𝑡,𝑠)   𝑉(𝑠)

Proof of Theorem cdleme50rnlem
Dummy variables 𝑒 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cdlemef50.b . . . 4 𝐵 = (Base‘𝐾)
2 cdlemef50.l . . . 4 = (le‘𝐾)
3 cdlemef50.j . . . 4 = (join‘𝐾)
4 cdlemef50.m . . . 4 = (meet‘𝐾)
5 cdlemef50.a . . . 4 𝐴 = (Atoms‘𝐾)
6 cdlemef50.h . . . 4 𝐻 = (LHyp‘𝐾)
7 cdlemef50.u . . . 4 𝑈 = ((𝑃 𝑄) 𝑊)
8 cdlemef50.d . . . 4 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
9 cdlemefs50.e . . . 4 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
10 cdlemef50.f . . . 4 𝐹 = (𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))), 𝑥))
111, 2, 3, 4, 5, 6, 7, 8, 9, 10cdleme50f 37714 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → 𝐹:𝐵𝐵)
1211frnd 6497 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ran 𝐹𝐵)
13 cdlemef50.v . . . . 5 𝑉 = ((𝑄 𝑃) 𝑊)
14 cdlemef50.n . . . . 5 𝑁 = ((𝑣 𝑉) (𝑃 ((𝑄 𝑣) 𝑊)))
15 cdlemefs50.o . . . . 5 𝑂 = ((𝑄 𝑃) (𝑁 ((𝑢 𝑣) 𝑊)))
16 cdlemef50.g . . . . 5 𝐺 = (𝑎𝐵 ↦ if((𝑄𝑃 ∧ ¬ 𝑎 𝑊), (𝑐𝐵𝑢𝐴 ((¬ 𝑢 𝑊 ∧ (𝑢 (𝑎 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 (𝑄 𝑃), (𝑏𝐵𝑣𝐴 ((¬ 𝑣 𝑊 ∧ ¬ 𝑣 (𝑄 𝑃)) → 𝑏 = 𝑂)), 𝑢 / 𝑣𝑁) (𝑎 𝑊)))), 𝑎))
171, 2, 3, 4, 5, 6, 13, 14, 15, 16cdlemeg46fvcl 37678 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑒𝐵) → (𝐺𝑒) ∈ 𝐵)
181, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16cdleme48fgv 37710 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑒𝐵) → (𝐹‘(𝐺𝑒)) = 𝑒)
19 fveqeq2 6655 . . . . 5 (𝑑 = (𝐺𝑒) → ((𝐹𝑑) = 𝑒 ↔ (𝐹‘(𝐺𝑒)) = 𝑒))
2019rspcev 3602 . . . 4 (((𝐺𝑒) ∈ 𝐵 ∧ (𝐹‘(𝐺𝑒)) = 𝑒) → ∃𝑑𝐵 (𝐹𝑑) = 𝑒)
2117, 18, 20syl2anc 586 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑒𝐵) → ∃𝑑𝐵 (𝐹𝑑) = 𝑒)
2211adantr 483 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑒𝐵) → 𝐹:𝐵𝐵)
23 ffn 6490 . . . 4 (𝐹:𝐵𝐵𝐹 Fn 𝐵)
24 fvelrnb 6702 . . . 4 (𝐹 Fn 𝐵 → (𝑒 ∈ ran 𝐹 ↔ ∃𝑑𝐵 (𝐹𝑑) = 𝑒))
2522, 23, 243syl 18 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑒𝐵) → (𝑒 ∈ ran 𝐹 ↔ ∃𝑑𝐵 (𝐹𝑑) = 𝑒))
2621, 25mpbird 259 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑒𝐵) → 𝑒 ∈ ran 𝐹)
2712, 26eqelssd 3967 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ran 𝐹 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  w3a 1083   = wceq 1537  wcel 2114  wne 3006  wral 3125  wrex 3126  csb 3860  ifcif 4443   class class class wbr 5042  cmpt 5122  ran crn 5532   Fn wfn 6326  wf 6327  cfv 6331  crio 7090  (class class class)co 7133  Basecbs 16462  lecple 16551  joincjn 17533  meetcmee 17534  Atomscatm 36435  HLchlt 36522  LHypclh 37156
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-rep 5166  ax-sep 5179  ax-nul 5186  ax-pow 5242  ax-pr 5306  ax-un 7439  ax-riotaBAD 36125
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3007  df-ral 3130  df-rex 3131  df-reu 3132  df-rmo 3133  df-rab 3134  df-v 3475  df-sbc 3753  df-csb 3861  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4270  df-if 4444  df-pw 4517  df-sn 4544  df-pr 4546  df-op 4550  df-uni 4815  df-iun 4897  df-iin 4898  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5436  df-xp 5537  df-rel 5538  df-cnv 5539  df-co 5540  df-dm 5541  df-rn 5542  df-res 5543  df-ima 5544  df-iota 6290  df-fun 6333  df-fn 6334  df-f 6335  df-f1 6336  df-fo 6337  df-f1o 6338  df-fv 6339  df-riota 7091  df-ov 7136  df-oprab 7137  df-mpo 7138  df-1st 7667  df-2nd 7668  df-undef 7917  df-proset 17517  df-poset 17535  df-plt 17547  df-lub 17563  df-glb 17564  df-join 17565  df-meet 17566  df-p0 17628  df-p1 17629  df-lat 17635  df-clat 17697  df-oposet 36348  df-ol 36350  df-oml 36351  df-covers 36438  df-ats 36439  df-atl 36470  df-cvlat 36494  df-hlat 36523  df-llines 36670  df-lplanes 36671  df-lvols 36672  df-lines 36673  df-psubsp 36675  df-pmap 36676  df-padd 36968  df-lhyp 37160
This theorem is referenced by:  cdleme50rn  37717
  Copyright terms: Public domain W3C validator