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

Theorem cdleme46fsvlpq 41386
Description: Show that (𝐹𝑅) is under 𝑃 𝑄 when 𝑅 is. (Contributed by NM, 1-Apr-2013.)
Hypotheses
Ref Expression
cdlemef46.b 𝐵 = (Base‘𝐾)
cdlemef46.l = (le‘𝐾)
cdlemef46.j = (join‘𝐾)
cdlemef46.m = (meet‘𝐾)
cdlemef46.a 𝐴 = (Atoms‘𝐾)
cdlemef46.h 𝐻 = (LHyp‘𝐾)
cdlemef46.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdlemef46.d 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
cdlemefs46.e 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
cdlemef46.f 𝐹 = (𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))), 𝑥))
Assertion
Ref Expression
cdleme46fsvlpq ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊)) ∧ 𝑅 (𝑃 𝑄)) → (𝐹𝑅) (𝑃 𝑄))
Distinct variable groups:   𝑡,𝑠,𝑥,𝑦,𝑧,𝐴   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝐷,𝑠,𝑥,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝐻,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑅,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐷(𝑡)   𝐸(𝑡, 𝑠)   𝐹(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)

Proof of Theorem cdleme46fsvlpq
StepHypRef Expression
1 cdlemef46.b . . 3 𝐵 = (Base‘𝐾)
2 cdlemef46.l . . 3 = (le‘𝐾)
3 cdlemef46.j . . 3 = (join‘𝐾)
4 cdlemef46.m . . 3 = (meet‘𝐾)
5 cdlemef46.a . . 3 𝐴 = (Atoms‘𝐾)
6 cdlemef46.h . . 3 𝐻 = (LHyp‘𝐾)
7 cdlemef46.u . . 3 𝑈 = ((𝑃 𝑄) 𝑊)
8 cdlemef46.d . . 3 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
9 cdlemefs46.e . . 3 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
10 eqid 2762 . . 3 (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)) = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸))
11 eqid 2762 . . 3 if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) = if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷)
12 eqid 2762 . . 3 (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))) = (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊))))
13 cdlemef46.f . . 3 𝐹 = (𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑥 𝑊)))), 𝑥))
141, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13cdlemefs32fva1 41304 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊)) ∧ 𝑅 (𝑃 𝑄)) → (𝐹𝑅) = 𝑅 / 𝑠if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷))
15 vex 3457 . . . 4 𝑠 ∈ V
16 eqid 2762 . . . . 5 ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊))) = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
178, 16cdleme31sc 41265 . . . 4 (𝑠 ∈ V → 𝑠 / 𝑡𝐷 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊))))
1815, 17ax-mp 5 . . 3 𝑠 / 𝑡𝐷 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
19 eqid 2762 . . 3 ((𝑃 𝑄) (𝐷 ((𝑅 𝑡) 𝑊))) = ((𝑃 𝑄) (𝐷 ((𝑅 𝑡) 𝑊)))
20 eqid 2762 . . 3 (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = ((𝑃 𝑄) (𝐷 ((𝑅 𝑡) 𝑊))))) = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = ((𝑃 𝑄) (𝐷 ((𝑅 𝑡) 𝑊)))))
211, 2, 3, 4, 5, 6, 7, 18, 8, 9, 10, 11, 19, 20cdleme41sn3a 41314 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊)) ∧ 𝑅 (𝑃 𝑄)) → 𝑅 / 𝑠if(𝑠 (𝑃 𝑄), (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸)), 𝑠 / 𝑡𝐷) (𝑃 𝑄))
2214, 21eqbrtrd 5131 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ (𝑅𝐴 ∧ ¬ 𝑅 𝑊)) ∧ 𝑅 (𝑃 𝑄)) → (𝐹𝑅) (𝑃 𝑄))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wne 2957  wral 3078  Vcvv 3453  csb 3850  ifcif 4485   class class class wbr 5107  cmpt 5190  cfv 6537  crio 7373  (class class class)co 7417  Basecbs 17307  lecple 17355  joincjn 18405  meetcmee 18406  Atomscatm 40144  HLchlt 40231  LHypclh 40865
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-riotaBAD 39834
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-undef 8275  df-proset 18388  df-poset 18407  df-plt 18422  df-lub 18438  df-glb 18439  df-join 18440  df-meet 18441  df-p0 18517  df-p1 18518  df-lat 18526  df-clat 18593  df-oposet 40057  df-ol 40059  df-oml 40060  df-covers 40147  df-ats 40148  df-atl 40179  df-cvlat 40203  df-hlat 40232  df-llines 40379  df-lplanes 40380  df-lvols 40381  df-lines 40382  df-psubsp 40384  df-pmap 40385  df-padd 40677  df-lhyp 40869
This theorem is used by:  cdlemeg46rgv  41409  cdlemeg46req  41410  cdlemeg46gfv  41411
  Copyright terms: Public domain W3C validator