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 36909
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 2793 . 2 𝑄 = 𝑄
2 oveq2 7015 . . . . . . 7 (𝐺 = 𝑄 → (𝑄 𝐺) = (𝑄 𝑄))
3 simp1l 1188 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝐾 ∈ HL)
4 simp22l 1283 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑄𝐴)
5 cdleme18.j . . . . . . . . 9 = (join‘𝐾)
6 cdleme18.a . . . . . . . . 9 𝐴 = (Atoms‘𝐾)
75, 6hlatjidm 35986 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑄𝐴) → (𝑄 𝑄) = 𝑄)
83, 4, 7syl2anc 584 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑄 𝑄) = 𝑄)
92, 8sylan9eqr 2851 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → (𝑄 𝐺) = 𝑄)
10 simp1 1127 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝐾 ∈ HL ∧ 𝑊𝐻))
11 simp21l 1281 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑃𝐴)
12 simp22 1198 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
13 simp23 1199 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑆𝐴 ∧ ¬ 𝑆 𝑊))
14 cdleme18.l . . . . . . . . . 10 = (le‘𝐾)
1514, 5, 6hlatlej2 35993 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑃𝐴𝑄𝐴) → 𝑄 (𝑃 𝑄))
163, 11, 4, 15syl3anc 1362 . . . . . . . 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 36857 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴𝑄𝐴 ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ 𝑄 (𝑃 𝑄))) → (𝑄 𝐺) = (𝑃 𝑄))
2310, 11, 4, 12, 13, 16, 22syl132anc 1379 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑄 𝐺) = (𝑃 𝑄))
2423adantr 481 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → (𝑄 𝐺) = (𝑃 𝑄))
259, 24eqtr3d 2831 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → 𝑄 = (𝑃 𝑄))
26 simp3l 1192 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑃𝑄)
275, 62atneat 36132 . . . . . . . 8 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑃𝑄)) → ¬ (𝑃 𝑄) ∈ 𝐴)
283, 11, 4, 26, 27syl13anc 1363 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → ¬ (𝑃 𝑄) ∈ 𝐴)
29 nelne2 3081 . . . . . . . 8 ((𝑄𝐴 ∧ ¬ (𝑃 𝑄) ∈ 𝐴) → 𝑄 ≠ (𝑃 𝑄))
3029necomd 3037 . . . . . . 7 ((𝑄𝐴 ∧ ¬ (𝑃 𝑄) ∈ 𝐴) → (𝑃 𝑄) ≠ 𝑄)
314, 28, 30syl2anc 584 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑃 𝑄) ≠ 𝑄)
3231adantr 481 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → (𝑃 𝑄) ≠ 𝑄)
3325, 32eqnetrd 3049 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) ∧ 𝐺 = 𝑄) → 𝑄𝑄)
3433ex 413 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝐺 = 𝑄𝑄𝑄))
3534necon2d 3005 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → (𝑄 = 𝑄𝐺𝑄))
361, 35mpi 20 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝐺𝑄)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1078   = wceq 1520  wcel 2079  wne 2982   class class class wbr 4956  cfv 6217  (class class class)co 7007  lecple 16389  joincjn 17371  meetcmee 17372  Atomscatm 35880  HLchlt 35967  LHypclh 36601
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1775  ax-4 1789  ax-5 1886  ax-6 1945  ax-7 1990  ax-8 2081  ax-9 2089  ax-10 2110  ax-11 2124  ax-12 2139  ax-13 2342  ax-ext 2767  ax-rep 5075  ax-sep 5088  ax-nul 5095  ax-pow 5150  ax-pr 5214  ax-un 7310
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1080  df-tru 1523  df-ex 1760  df-nf 1764  df-sb 2041  df-mo 2574  df-eu 2610  df-clab 2774  df-cleq 2786  df-clel 2861  df-nfc 2933  df-ne 2983  df-ral 3108  df-rex 3109  df-reu 3110  df-rab 3112  df-v 3434  df-sbc 3702  df-csb 3807  df-dif 3857  df-un 3859  df-in 3861  df-ss 3869  df-nul 4207  df-if 4376  df-pw 4449  df-sn 4467  df-pr 4469  df-op 4473  df-uni 4740  df-iun 4821  df-iin 4822  df-br 4957  df-opab 5019  df-mpt 5036  df-id 5340  df-xp 5441  df-rel 5442  df-cnv 5443  df-co 5444  df-dm 5445  df-rn 5446  df-res 5447  df-ima 5448  df-iota 6181  df-fun 6219  df-fn 6220  df-f 6221  df-f1 6222  df-fo 6223  df-f1o 6224  df-fv 6225  df-riota 6968  df-ov 7010  df-oprab 7011  df-mpo 7012  df-1st 7536  df-2nd 7537  df-proset 17355  df-poset 17373  df-plt 17385  df-lub 17401  df-glb 17402  df-join 17403  df-meet 17404  df-p0 17466  df-p1 17467  df-lat 17473  df-clat 17535  df-oposet 35793  df-ol 35795  df-oml 35796  df-covers 35883  df-ats 35884  df-atl 35915  df-cvlat 35939  df-hlat 35968  df-llines 36115  df-psubsp 36120  df-pmap 36121  df-padd 36413  df-lhyp 36605
This theorem is referenced by:  cdleme18c  36910
  Copyright terms: Public domain W3C validator