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

Theorem cdleme32d 36234
Description: Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 20-Feb-2013.)
Hypotheses
Ref Expression
cdleme32.b 𝐵 = (Base‘𝐾)
cdleme32.l = (le‘𝐾)
cdleme32.j = (join‘𝐾)
cdleme32.m = (meet‘𝐾)
cdleme32.a 𝐴 = (Atoms‘𝐾)
cdleme32.h 𝐻 = (LHyp‘𝐾)
cdleme32.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdleme32.c 𝐶 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
cdleme32.d 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
cdleme32.e 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
cdleme32.i 𝐼 = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸))
cdleme32.n 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐶)
cdleme32.o 𝑂 = (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (𝑁 (𝑥 𝑊))))
cdleme32.f 𝐹 = (𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), 𝑂, 𝑥))
Assertion
Ref Expression
cdleme32d ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) → (𝐹𝑋) (𝐹𝑌))
Distinct variable groups:   𝑡,𝑠,𝑥,𝑦,𝑧,𝐴   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝑦,𝐶   𝐷,𝑠,𝑦,𝑧   𝑦,𝐸   𝐻,𝑠,𝑡   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡   ,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝑥,𝑁,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   𝑋,𝑠,𝑡,𝑥,𝑧   𝑦,𝐻   𝑦,𝐾   𝑦,𝑌   𝑧,𝐻   𝑧,𝐾   𝑌,𝑠,𝑡,𝑥,𝑧
Allowed substitution hints:   𝐶(𝑥,𝑧,𝑡,𝑠)   𝐷(𝑥,𝑡)   𝐸(𝑥,𝑧,𝑡,𝑠)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐻(𝑥)   𝐼(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐾(𝑥)   𝑁(𝑦,𝑡,𝑠)   𝑂(𝑥,𝑦,𝑧,𝑡,𝑠)   𝑋(𝑦)

Proof of Theorem cdleme32d
StepHypRef Expression
1 simp11 1246 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simp21 1249 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) → 𝑋𝐵)
3 simp23r 1380 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) → ¬ 𝑋 𝑊)
4 cdleme32.b . . . 4 𝐵 = (Base‘𝐾)
5 cdleme32.l . . . 4 = (le‘𝐾)
6 cdleme32.j . . . 4 = (join‘𝐾)
7 cdleme32.m . . . 4 = (meet‘𝐾)
8 cdleme32.a . . . 4 𝐴 = (Atoms‘𝐾)
9 cdleme32.h . . . 4 𝐻 = (LHyp‘𝐾)
104, 5, 6, 7, 8, 9lhpmcvr2 35813 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) → ∃𝑠𝐴𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))
111, 2, 3, 10syl12anc 1475 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) → ∃𝑠𝐴𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))
12 nfv 1992 . . 3 𝑠(((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌)
13 cdleme32.f . . . . . 6 𝐹 = (𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), 𝑂, 𝑥))
14 nfcv 2902 . . . . . . 7 𝑠𝐵
15 nfv 1992 . . . . . . . 8 𝑠(𝑃𝑄 ∧ ¬ 𝑥 𝑊)
16 cdleme32.o . . . . . . . . 9 𝑂 = (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (𝑁 (𝑥 𝑊))))
17 nfra1 3079 . . . . . . . . . 10 𝑠𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (𝑁 (𝑥 𝑊)))
1817, 14nfriota 6783 . . . . . . . . 9 𝑠(𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (𝑁 (𝑥 𝑊))))
1916, 18nfcxfr 2900 . . . . . . . 8 𝑠𝑂
20 nfcv 2902 . . . . . . . 8 𝑠𝑥
2115, 19, 20nfif 4259 . . . . . . 7 𝑠if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), 𝑂, 𝑥)
2214, 21nfmpt 4898 . . . . . 6 𝑠(𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), 𝑂, 𝑥))
2313, 22nfcxfr 2900 . . . . 5 𝑠𝐹
24 nfcv 2902 . . . . 5 𝑠𝑋
2523, 24nffv 6359 . . . 4 𝑠(𝐹𝑋)
26 nfcv 2902 . . . 4 𝑠
27 nfcv 2902 . . . . 5 𝑠𝑌
2823, 27nffv 6359 . . . 4 𝑠(𝐹𝑌)
2925, 26, 28nfbr 4851 . . 3 𝑠(𝐹𝑋) (𝐹𝑌)
30 simpl1 1228 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) ∧ (𝑠𝐴 ∧ (¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))) → ((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)))
31 simpl2 1230 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) ∧ (𝑠𝐴 ∧ (¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))) → (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)))
32 simprl 811 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) ∧ (𝑠𝐴 ∧ (¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))) → 𝑠𝐴)
33 simprrl 823 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) ∧ (𝑠𝐴 ∧ (¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))) → ¬ 𝑠 𝑊)
3432, 33jca 555 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) ∧ (𝑠𝐴 ∧ (¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))) → (𝑠𝐴 ∧ ¬ 𝑠 𝑊))
35 simprrr 824 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) ∧ (𝑠𝐴 ∧ (¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))) → (𝑠 (𝑋 𝑊)) = 𝑋)
36 simpl3 1232 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) ∧ (𝑠𝐴 ∧ (¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))) → 𝑋 𝑌)
37 cdleme32.u . . . . . 6 𝑈 = ((𝑃 𝑄) 𝑊)
38 cdleme32.c . . . . . 6 𝐶 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
39 cdleme32.d . . . . . 6 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
40 cdleme32.e . . . . . 6 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
41 cdleme32.i . . . . . 6 𝐼 = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸))
42 cdleme32.n . . . . . 6 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐶)
434, 5, 6, 7, 8, 9, 37, 38, 39, 40, 41, 42, 16, 13cdleme32c 36233 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ ((𝑠𝐴 ∧ ¬ 𝑠 𝑊) ∧ (𝑠 (𝑋 𝑊)) = 𝑋𝑋 𝑌)) → (𝐹𝑋) (𝐹𝑌))
4430, 31, 34, 35, 36, 43syl113anc 1489 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) ∧ (𝑠𝐴 ∧ (¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋))) → (𝐹𝑋) (𝐹𝑌))
4544exp32 632 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) → (𝑠𝐴 → ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋) → (𝐹𝑋) (𝐹𝑌))))
4612, 29, 45rexlimd 3164 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) → (∃𝑠𝐴𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋) → (𝐹𝑋) (𝐹𝑌)))
4711, 46mpd 15 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) ∧ 𝑋 𝑌) → (𝐹𝑋) (𝐹𝑌))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  w3a 1072   = wceq 1632  wcel 2139  wne 2932  wral 3050  wrex 3051  ifcif 4230   class class class wbr 4804  cmpt 4881  cfv 6049  crio 6773  (class class class)co 6813  Basecbs 16059  lecple 16150  joincjn 17145  meetcmee 17146  Atomscatm 35053  HLchlt 35140  LHypclh 35773
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114  ax-riotaBAD 34742
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rmo 3058  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-iun 4674  df-iin 4675  df-br 4805  df-opab 4865  df-mpt 4882  df-id 5174  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-riota 6774  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-1st 7333  df-2nd 7334  df-undef 7568  df-preset 17129  df-poset 17147  df-plt 17159  df-lub 17175  df-glb 17176  df-join 17177  df-meet 17178  df-p0 17240  df-p1 17241  df-lat 17247  df-clat 17309  df-oposet 34966  df-ol 34968  df-oml 34969  df-covers 35056  df-ats 35057  df-atl 35088  df-cvlat 35112  df-hlat 35141  df-llines 35287  df-lplanes 35288  df-lvols 35289  df-lines 35290  df-psubsp 35292  df-pmap 35293  df-padd 35585  df-lhyp 35777
This theorem is referenced by:  cdleme32le  36237
  Copyright terms: Public domain W3C validator