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

Theorem cdlemefs27cl 38164
Description: Part of proof of Lemma E in [Crawley] p. 113. Closure of 𝑁. TODO FIX COMMENT This is the start of a re-proof of cdleme27cl 38117 etc. with the 𝑠 (𝑃 𝑄) condition (so as to not have the 𝐶 hypothesis). (Contributed by NM, 24-Mar-2013.)
Hypotheses
Ref Expression
cdlemefs26.b 𝐵 = (Base‘𝐾)
cdlemefs26.l = (le‘𝐾)
cdlemefs26.j = (join‘𝐾)
cdlemefs26.m = (meet‘𝐾)
cdlemefs26.a 𝐴 = (Atoms‘𝐾)
cdlemefs26.h 𝐻 = (LHyp‘𝐾)
cdlemefs27.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdlemefs27.d 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
cdlemefs27.e 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
cdlemefs27.i 𝐼 = (𝑢𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑢 = 𝐸))
cdlemefs27.n 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐶)
Assertion
Ref Expression
cdlemefs27cl ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → 𝑁𝐵)
Distinct variable groups:   𝑢,𝑡,𝐴   𝑡,𝐵,𝑢   𝑢,𝐸   𝑡,𝐻   𝑡, ,𝑢   𝑡,𝐾   𝑡, ,𝑢   𝑡, ,𝑢   𝑡,𝑃,𝑢   𝑡,𝑄,𝑢   𝑡,𝑈,𝑢   𝑡,𝑊,𝑢   𝑡,𝑠,𝑢
Allowed substitution hints:   𝐴(𝑠)   𝐵(𝑠)   𝐶(𝑢,𝑡,𝑠)   𝐷(𝑢,𝑡,𝑠)   𝑃(𝑠)   𝑄(𝑠)   𝑈(𝑠)   𝐸(𝑡,𝑠)   𝐻(𝑢,𝑠)   𝐼(𝑢,𝑡,𝑠)   (𝑠)   𝐾(𝑢,𝑠)   (𝑠)   (𝑠)   𝑁(𝑢,𝑡,𝑠)   𝑊(𝑠)

Proof of Theorem cdlemefs27cl
StepHypRef Expression
1 cdlemefs27.n . 2 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐶)
2 simpr2 1197 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → 𝑠 (𝑃 𝑄))
32iftrued 4447 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → if(𝑠 (𝑃 𝑄), 𝐼, 𝐶) = 𝐼)
4 simpl1 1193 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
5 simpl2 1194 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
6 simpl3 1195 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
7 simpr1 1196 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → (𝑠𝐴 ∧ ¬ 𝑠 𝑊))
8 simpr3 1198 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → 𝑃𝑄)
9 cdlemefs26.b . . . . 5 𝐵 = (Base‘𝐾)
10 cdlemefs26.l . . . . 5 = (le‘𝐾)
11 cdlemefs26.j . . . . 5 = (join‘𝐾)
12 cdlemefs26.m . . . . 5 = (meet‘𝐾)
13 cdlemefs26.a . . . . 5 𝐴 = (Atoms‘𝐾)
14 cdlemefs26.h . . . . 5 𝐻 = (LHyp‘𝐾)
15 cdlemefs27.u . . . . 5 𝑈 = ((𝑃 𝑄) 𝑊)
16 cdlemefs27.d . . . . 5 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
17 cdlemefs27.e . . . . 5 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
18 cdlemefs27.i . . . . 5 𝐼 = (𝑢𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑢 = 𝐸))
199, 10, 11, 12, 13, 14, 15, 16, 17, 18cdleme25cl 38108 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ (𝑃𝑄𝑠 (𝑃 𝑄))) → 𝐼𝐵)
204, 5, 6, 7, 8, 2, 19syl312anc 1393 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → 𝐼𝐵)
213, 20eqeltrd 2838 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → if(𝑠 (𝑃 𝑄), 𝐼, 𝐶) ∈ 𝐵)
221, 21eqeltrid 2842 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ 𝑠 (𝑃 𝑄) ∧ 𝑃𝑄)) → 𝑁𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2110  wne 2940  wral 3061  ifcif 4439   class class class wbr 5053  cfv 6380  crio 7169  (class class class)co 7213  Basecbs 16760  lecple 16809  joincjn 17818  meetcmee 17819  Atomscatm 37014  HLchlt 37101  LHypclh 37735
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-rep 5179  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3410  df-sbc 3695  df-csb 3812  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-iun 4906  df-iin 4907  df-br 5054  df-opab 5116  df-mpt 5136  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-f1 6385  df-fo 6386  df-f1o 6387  df-fv 6388  df-riota 7170  df-ov 7216  df-oprab 7217  df-mpo 7218  df-1st 7761  df-2nd 7762  df-proset 17802  df-poset 17820  df-plt 17836  df-lub 17852  df-glb 17853  df-join 17854  df-meet 17855  df-p0 17931  df-p1 17932  df-lat 17938  df-clat 18005  df-oposet 36927  df-ol 36929  df-oml 36930  df-covers 37017  df-ats 37018  df-atl 37049  df-cvlat 37073  df-hlat 37102  df-llines 37249  df-lplanes 37250  df-lvols 37251  df-lines 37252  df-psubsp 37254  df-pmap 37255  df-padd 37547  df-lhyp 37739
This theorem is referenced by:  cdlemefs29bpre0N  38167  cdlemefs29bpre1N  38168  cdlemefs29cpre1N  38169  cdlemefs29clN  38170  cdlemefs32fvaN  38173  cdlemefs32fva1  38174
  Copyright terms: Public domain W3C validator