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

Theorem cdlemg17b 40046
Description: Part of proof of Lemma G in [Crawley] p. 117, 4th line. Whenever (in their terminology) p q/0 (i.e. the sublattice from 0 to p q) contains precisely three atoms and g is not the identity, g(p) = q. See also comments under cdleme0nex 39674. (Contributed by NM, 8-May-2013.)
Hypotheses
Ref Expression
cdlemg12.l = (le‘𝐾)
cdlemg12.j = (join‘𝐾)
cdlemg12.m = (meet‘𝐾)
cdlemg12.a 𝐴 = (Atoms‘𝐾)
cdlemg12.h 𝐻 = (LHyp‘𝐾)
cdlemg12.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg12b.r 𝑅 = ((trL‘𝐾)‘𝑊)
Assertion
Ref Expression
cdlemg17b ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → (𝐺𝑃) = 𝑄)
Distinct variable groups:   𝐴,𝑟   𝐺,𝑟   ,𝑟   ,𝑟   𝑃,𝑟   𝑄,𝑟   𝑊,𝑟
Allowed substitution hints:   𝑅(𝑟)   𝑇(𝑟)   𝐻(𝑟)   𝐾(𝑟)   (𝑟)

Proof of Theorem cdlemg17b
StepHypRef Expression
1 simp31 1206 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → (𝐺𝑃) ≠ 𝑃)
21neneqd 2939 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → ¬ (𝐺𝑃) = 𝑃)
3 simp11l 1281 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → 𝐾 ∈ HL)
4 simp11 1200 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → (𝐾 ∈ HL ∧ 𝑊𝐻))
5 simp12 1201 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
6 simp13 1202 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
7 simp2l 1196 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → 𝐺𝑇)
8 simp32 1207 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → (𝑅𝐺) (𝑃 𝑄))
9 cdlemg12.l . . . . . 6 = (le‘𝐾)
10 cdlemg12.j . . . . . 6 = (join‘𝐾)
11 cdlemg12.m . . . . . 6 = (meet‘𝐾)
12 cdlemg12.a . . . . . 6 𝐴 = (Atoms‘𝐾)
13 cdlemg12.h . . . . . 6 𝐻 = (LHyp‘𝐾)
14 cdlemg12.t . . . . . 6 𝑇 = ((LTrn‘𝐾)‘𝑊)
15 cdlemg12b.r . . . . . 6 𝑅 = ((trL‘𝐾)‘𝑊)
169, 10, 11, 12, 13, 14, 15cdlemg17a 40045 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇 ∧ (𝑅𝐺) (𝑃 𝑄))) → (𝐺𝑃) (𝑃 𝑄))
174, 5, 6, 7, 8, 16syl122anc 1376 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → (𝐺𝑃) (𝑃 𝑄))
18 simp33 1208 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))
19 simp12l 1283 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → 𝑃𝐴)
20 simp13l 1285 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → 𝑄𝐴)
21 simp2r 1197 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → 𝑃𝑄)
229, 12, 13, 14ltrnel 39523 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐺𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ((𝐺𝑃) ∈ 𝐴 ∧ ¬ (𝐺𝑃) 𝑊))
234, 7, 5, 22syl3anc 1368 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → ((𝐺𝑃) ∈ 𝐴 ∧ ¬ (𝐺𝑃) 𝑊))
249, 10, 12cdleme0nex 39674 . . . 4 (((𝐾 ∈ HL ∧ (𝐺𝑃) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) ∧ (𝑃𝐴𝑄𝐴𝑃𝑄) ∧ ((𝐺𝑃) ∈ 𝐴 ∧ ¬ (𝐺𝑃) 𝑊)) → ((𝐺𝑃) = 𝑃 ∨ (𝐺𝑃) = 𝑄))
253, 17, 18, 19, 20, 21, 23, 24syl331anc 1392 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → ((𝐺𝑃) = 𝑃 ∨ (𝐺𝑃) = 𝑄))
2625ord 861 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → (¬ (𝐺𝑃) = 𝑃 → (𝐺𝑃) = 𝑄))
272, 26mpd 15 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐺𝑇𝑃𝑄) ∧ ((𝐺𝑃) ≠ 𝑃 ∧ (𝑅𝐺) (𝑃 𝑄) ∧ ¬ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → (𝐺𝑃) = 𝑄)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 844  w3a 1084   = wceq 1533  wcel 2098  wne 2934  wrex 3064   class class class wbr 5141  cfv 6537  (class class class)co 7405  lecple 17213  joincjn 18276  meetcmee 18277  Atomscatm 38646  HLchlt 38733  LHypclh 39368  LTrncltrn 39485  trLctrl 39542
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-rep 5278  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7722
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rmo 3370  df-reu 3371  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-iun 4992  df-iin 4993  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7974  df-2nd 7975  df-map 8824  df-proset 18260  df-poset 18278  df-plt 18295  df-lub 18311  df-glb 18312  df-join 18313  df-meet 18314  df-p0 18390  df-p1 18391  df-lat 18397  df-clat 18464  df-oposet 38559  df-ol 38561  df-oml 38562  df-covers 38649  df-ats 38650  df-atl 38681  df-cvlat 38705  df-hlat 38734  df-psubsp 38887  df-pmap 38888  df-padd 39180  df-lhyp 39372  df-laut 39373  df-ldil 39488  df-ltrn 39489  df-trl 39543
This theorem is referenced by:  cdlemg17dN  40047  cdlemg17e  40049  cdlemg17ir  40054  cdlemg17bq  40057  cdlemg17  40061  cdlemg18d  40065
  Copyright terms: Public domain W3C validator