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

Theorem cdlemg17bq 41922
Description: cdlemg17b 41911 with 𝑃 and 𝑄 swapped. Antecedent 𝐹 ∈ (𝑇‘𝑊) is redundant for easier use. TODO: should we have redundant antecedent for cdlemg17b 41911 also? (Contributed by NM, 13-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
cdlemg17bq ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘𝑄) = 𝑃)
Distinct variable groups:   𝐴,𝑟   𝐺,𝑟   ∨ ,𝑟   ≤ ,𝑟   𝑃,𝑟   𝑄,𝑟   𝑊,𝑟   𝐹,𝑟
Allowed substitution hints:   𝑅(𝑟)   𝑇(𝑟)   𝐻(𝑟)   𝐾(𝑟)   ∧ (𝑟)

Proof of Theorem cdlemg17bq
StepHypRef Expression
1 cdlemg12.l . . 3 ≤ = (le‘𝐾)
2 cdlemg12.j . . 3 ∨ = (join‘𝐾)
3 cdlemg12.m . . 3 ∧ = (meet‘𝐾)
4 cdlemg12.a . . 3 𝐴 = (Atoms‘𝐾)
5 cdlemg12.h . . 3 𝐻 = (LHyp‘𝐾)
6 cdlemg12.t . . 3 𝑇 = ((LTrn‘𝐾)‘𝑊)
7 cdlemg12b.r . . 3 𝑅 = ((trL‘𝐾)‘𝑊)
81, 2, 3, 4, 5, 6, 7cdlemg17pq 41921 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))))
9 simp11 1222 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
10 simp12 1223 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
11 simp13 1224 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
12 simp22 1226 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))) → 𝐺 ∈ 𝑇)
13 simp23 1227 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))) → 𝑄 ≠ 𝑃)
14 simp3 1156 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))) → ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟))))
151, 2, 3, 4, 5, 6, 7cdlemg17b 41911 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))) → (𝐺‘𝑄) = 𝑃)
169, 10, 11, 12, 13, 14, 15syl321anc 1420 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))) → (𝐺‘𝑄) = 𝑃)
178, 16syl 18 1 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘𝑄) = 𝑃)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  lecple 17464  joincjn 18514  meetcmee 18515  Atomscatm 40512  HLchlt 40599  LHypclh 41233  LTrncltrn 41350  trLctrl 41407
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-map 8877  df-proset 18497  df-poset 18516  df-plt 18531  df-lub 18547  df-glb 18548  df-join 18549  df-meet 18550  df-p0 18626  df-p1 18627  df-lat 18635  df-clat 18702  df-oposet 40425  df-ol 40427  df-oml 40428  df-covers 40515  df-ats 40516  df-atl 40547  df-cvlat 40571  df-hlat 40600  df-psubsp 40752  df-pmap 40753  df-padd 41045  df-lhyp 41237  df-laut 41238  df-ldil 41353  df-ltrn 41354  df-trl 41408
This theorem is used by:  cdlemg17  41926  cdlemg18d  41930
  Copyright terms: Public domain W3C validator