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

Theorem cdleme18b 34396
Description: Part of proof of Lemma E in [Crawley] p. 114, 2nd sentence of 4th paragraph. 𝐹, 𝐺 represent f(s), fs(q) respectively. We show ¬ fs(q) q. (Contributed by NM, 12-Oct-2012.)
Hypotheses
Ref Expression
cdleme18.l = (le‘𝐾)
cdleme18.j = (join‘𝐾)
cdleme18.m = (meet‘𝐾)
cdleme18.a 𝐴 = (Atoms‘𝐾)
cdleme18.h 𝐻 = (LHyp‘𝐾)
cdleme18.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdleme18.f 𝐹 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊)))
cdleme18.g 𝐺 = ((𝑃 𝑄) (𝐹 ((𝑄 𝑆) 𝑊)))
Assertion
Ref Expression
cdleme18b (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝐺𝑄)

Proof of Theorem cdleme18b
StepHypRef Expression
1 eqid 2605 . 2 𝑄 = 𝑄
2 oveq2 6531 . . . . . . 7 (𝐺 = 𝑄 → (𝑄 𝐺) = (𝑄 𝑄))
3 simp1l 1077 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝐾 ∈ HL)
4 simp22l 1172 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑄𝐴)
5 cdleme18.j . . . . . . . . 9 = (join‘𝐾)
6 cdleme18.a . . . . . . . . 9 𝐴 = (Atoms‘𝐾)
75, 6hlatjidm 33472 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑄𝐴) → (𝑄 𝑄) = 𝑄)
83, 4, 7syl2anc 690 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑄 𝑄) = 𝑄)
92, 8sylan9eqr 2661 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → (𝑄 𝐺) = 𝑄)
10 simp1 1053 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝐾 ∈ HL ∧ 𝑊𝐻))
11 simp21l 1170 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑃𝐴)
12 simp22 1087 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
13 simp23 1088 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑆𝐴 ∧ ¬ 𝑆 𝑊))
14 cdleme18.l . . . . . . . . . 10 = (le‘𝐾)
1514, 5, 6hlatlej2 33479 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑃𝐴𝑄𝐴) → 𝑄 (𝑃 𝑄))
163, 11, 4, 15syl3anc 1317 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑄 (𝑃 𝑄))
17 cdleme18.m . . . . . . . . 9 = (meet‘𝐾)
18 cdleme18.h . . . . . . . . 9 𝐻 = (LHyp‘𝐾)
19 cdleme18.u . . . . . . . . 9 𝑈 = ((𝑃 𝑄) 𝑊)
20 cdleme18.f . . . . . . . . 9 𝐹 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊)))
21 cdleme18.g . . . . . . . . 9 𝐺 = ((𝑃 𝑄) (𝐹 ((𝑄 𝑆) 𝑊)))
2214, 5, 17, 6, 18, 19, 20, 21cdleme5 34344 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴𝑄𝐴 ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ 𝑄 (𝑃 𝑄))) → (𝑄 𝐺) = (𝑃 𝑄))
2310, 11, 4, 12, 13, 16, 22syl132anc 1335 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑄 𝐺) = (𝑃 𝑄))
2423adantr 479 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → (𝑄 𝐺) = (𝑃 𝑄))
259, 24eqtr3d 2641 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → 𝑄 = (𝑃 𝑄))
26 simp3l 1081 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑃𝑄)
275, 62atneat 33618 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑃𝑄)) → ¬ (𝑃 𝑄) ∈ 𝐴)
283, 11, 4, 26, 27syl13anc 1319 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → ¬ (𝑃 𝑄) ∈ 𝐴)
29 nelne2 2874 . . . . . . . 8 ((𝑄𝐴 ∧ ¬ (𝑃 𝑄) ∈ 𝐴) → 𝑄 ≠ (𝑃 𝑄))
3029necomd 2832 . . . . . . 7 ((𝑄𝐴 ∧ ¬ (𝑃 𝑄) ∈ 𝐴) → (𝑃 𝑄) ≠ 𝑄)
314, 28, 30syl2anc 690 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑃 𝑄) ≠ 𝑄)
3231adantr 479 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → (𝑃 𝑄) ≠ 𝑄)
3325, 32eqnetrd 2844 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → 𝑄𝑄)
3433ex 448 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝐺 = 𝑄𝑄𝑄))
3534necon2d 2800 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑄 = 𝑄𝐺𝑄))
361, 35mpi 20 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝐺𝑄)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 382  w3a 1030   = wceq 1474  wcel 1975  wne 2775   class class class wbr 4573  cfv 5786  (class class class)co 6523  lecple 15717  joincjn 16709  meetcmee 16710  Atomscatm 33367  HLchlt 33454  LHypclh 34087
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-8 1977  ax-9 1984  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2228  ax-ext 2585  ax-rep 4689  ax-sep 4699  ax-nul 4708  ax-pow 4760  ax-pr 4824  ax-un 6820
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-eu 2457  df-mo 2458  df-clab 2592  df-cleq 2598  df-clel 2601  df-nfc 2735  df-ne 2777  df-ral 2896  df-rex 2897  df-reu 2898  df-rab 2900  df-v 3170  df-sbc 3398  df-csb 3495  df-dif 3538  df-un 3540  df-in 3542  df-ss 3549  df-nul 3870  df-if 4032  df-pw 4105  df-sn 4121  df-pr 4123  df-op 4127  df-uni 4363  df-iun 4447  df-iin 4448  df-br 4574  df-opab 4634  df-mpt 4635  df-id 4939  df-xp 5030  df-rel 5031  df-cnv 5032  df-co 5033  df-dm 5034  df-rn 5035  df-res 5036  df-ima 5037  df-iota 5750  df-fun 5788  df-fn 5789  df-f 5790  df-f1 5791  df-fo 5792  df-f1o 5793  df-fv 5794  df-riota 6485  df-ov 6526  df-oprab 6527  df-mpt2 6528  df-1st 7032  df-2nd 7033  df-preset 16693  df-poset 16711  df-plt 16723  df-lub 16739  df-glb 16740  df-join 16741  df-meet 16742  df-p0 16804  df-p1 16805  df-lat 16811  df-clat 16873  df-oposet 33280  df-ol 33282  df-oml 33283  df-covers 33370  df-ats 33371  df-atl 33402  df-cvlat 33426  df-hlat 33455  df-llines 33601  df-psubsp 33606  df-pmap 33607  df-padd 33899  df-lhyp 34091
This theorem is referenced by:  cdleme18c  34397
  Copyright terms: Public domain W3C validator