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

Theorem cdlemb3 41479
Description: Given two atoms not under the fiducial co-atom 𝑊, there is a third. Lemma B in [Crawley] p. 112. TODO: Is there a simpler more direct proof, that could be placed earlier e.g. near lhpexle 40878? Then replace cdlemb2 40914 with it. This is a more general version of cdlemb2 40914 without 𝑃𝑄 condition. (Contributed by NM, 27-Apr-2013.)
Hypotheses
Ref Expression
cdlemg5.l = (le‘𝐾)
cdlemg5.j = (join‘𝐾)
cdlemg5.a 𝐴 = (Atoms‘𝐾)
cdlemg5.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
cdlemb3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
Distinct variable groups:   𝐴,𝑟   𝐻,𝑟   𝐾,𝑟   ,𝑟   𝑃,𝑟   𝑊,𝑟   ,𝑟   𝑄,𝑟

Proof of Theorem cdlemb3
StepHypRef Expression
1 simpl1 1210 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simpl2 1211 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
3 cdlemg5.l . . . . 5 = (le‘𝐾)
4 cdlemg5.j . . . . 5 = (join‘𝐾)
5 cdlemg5.a . . . . 5 𝐴 = (Atoms‘𝐾)
6 cdlemg5.h . . . . 5 𝐻 = (LHyp‘𝐾)
73, 4, 5, 6cdlemg5 41478 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ∃𝑟𝐴 (𝑃𝑟 ∧ ¬ 𝑟 𝑊))
81, 2, 7syl2anc 596 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → ∃𝑟𝐴 (𝑃𝑟 ∧ ¬ 𝑟 𝑊))
9 ancom 466 . . . . . 6 ((𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ (¬ 𝑟 𝑊𝑃𝑟))
10 eqcom 2767 . . . . . . . . 9 (𝑃 = 𝑟𝑟 = 𝑃)
11 simp2 1155 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝑃 = 𝑄)
1211oveq2d 7429 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 𝑃) = (𝑃 𝑄))
13 simp11l 1303 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝐾 ∈ HL)
14 simp12l 1305 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝑃𝐴)
154, 5hlatjidm 40242 . . . . . . . . . . . . 13 ((𝐾 ∈ HL ∧ 𝑃𝐴) → (𝑃 𝑃) = 𝑃)
1613, 14, 15syl2anc 596 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 𝑃) = 𝑃)
1712, 16eqtr3d 2797 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 𝑄) = 𝑃)
1817breq2d 5115 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑟 (𝑃 𝑄) ↔ 𝑟 𝑃))
19 hlatl 40233 . . . . . . . . . . . 12 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
2013, 19syl 18 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝐾 ∈ AtLat)
21 simp3 1156 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝑟𝐴)
223, 5atcmp 40184 . . . . . . . . . . 11 ((𝐾 ∈ AtLat ∧ 𝑟𝐴𝑃𝐴) → (𝑟 𝑃𝑟 = 𝑃))
2320, 21, 14, 22syl3anc 1398 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑟 𝑃𝑟 = 𝑃))
2418, 23bitr2d 283 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑟 = 𝑃𝑟 (𝑃 𝑄)))
2510, 24bitrid 286 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 = 𝑟𝑟 (𝑃 𝑄)))
2625necon3abid 2991 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃𝑟 ↔ ¬ 𝑟 (𝑃 𝑄)))
2726anbi2d 642 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → ((¬ 𝑟 𝑊𝑃𝑟) ↔ (¬ 𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
289, 27bitrid 286 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → ((𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ (¬ 𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
29283expa 1136 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) ∧ 𝑟𝐴) → ((𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ (¬ 𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
3029rexbidva 3184 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → (∃𝑟𝐴 (𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
318, 30mpbid 235 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
32 simpl1 1210 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → (𝐾 ∈ HL ∧ 𝑊𝐻))
33 simpl2 1211 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
34 simpl3 1212 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
35 simpr 490 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → 𝑃𝑄)
363, 4, 5, 6cdlemb2 40914 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
3732, 33, 34, 35, 36syl121anc 1402 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
3831, 37pm2.61dane 3042 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145  wne 2955  wrex 3086   class class class wbr 5103  cfv 6533  (class class class)co 7413  lecple 17349  joincjn 18399  Atomscatm 40136  AtLatcal 40137  HLchlt 40223  LHypclh 40857
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-proset 18382  df-poset 18401  df-plt 18416  df-lub 18432  df-glb 18433  df-join 18434  df-meet 18435  df-p0 18511  df-p1 18512  df-lat 18520  df-clat 18587  df-oposet 40049  df-ol 40051  df-oml 40052  df-covers 40139  df-ats 40140  df-atl 40171  df-cvlat 40195  df-hlat 40224  df-lhyp 40861
This theorem is used by:  cdlemg6e  41495
  Copyright terms: Public domain W3C validator