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 37895
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 37294? Then replace cdlemb2 37330 with it. This is a more general version of cdlemb2 37330 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 1188 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simpl2 1189 . . . 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 37894 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ∃𝑟𝐴 (𝑃𝑟 ∧ ¬ 𝑟 𝑊))
81, 2, 7syl2anc 587 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → ∃𝑟𝐴 (𝑃𝑟 ∧ ¬ 𝑟 𝑊))
9 ancom 464 . . . . . 6 ((𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ (¬ 𝑟 𝑊𝑃𝑟))
10 eqcom 2808 . . . . . . . . 9 (𝑃 = 𝑟𝑟 = 𝑃)
11 simp2 1134 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝑃 = 𝑄)
1211oveq2d 7155 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 𝑃) = (𝑃 𝑄))
13 simp11l 1281 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝐾 ∈ HL)
14 simp12l 1283 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝑃𝐴)
154, 5hlatjidm 36658 . . . . . . . . . . . . 13 ((𝐾 ∈ HL ∧ 𝑃𝐴) → (𝑃 𝑃) = 𝑃)
1613, 14, 15syl2anc 587 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 𝑃) = 𝑃)
1712, 16eqtr3d 2838 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 𝑄) = 𝑃)
1817breq2d 5045 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑟 (𝑃 𝑄) ↔ 𝑟 𝑃))
19 hlatl 36649 . . . . . . . . . . . 12 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
2013, 19syl 17 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝐾 ∈ AtLat)
21 simp3 1135 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝑟𝐴)
223, 5atcmp 36600 . . . . . . . . . . 11 ((𝐾 ∈ AtLat ∧ 𝑟𝐴𝑃𝐴) → (𝑟 𝑃𝑟 = 𝑃))
2320, 21, 14, 22syl3anc 1368 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑟 𝑃𝑟 = 𝑃))
2418, 23bitr2d 283 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑟 = 𝑃𝑟 (𝑃 𝑄)))
2510, 24syl5bb 286 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 = 𝑟𝑟 (𝑃 𝑄)))
2625necon3abid 3026 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃𝑟 ↔ ¬ 𝑟 (𝑃 𝑄)))
2726anbi2d 631 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → ((¬ 𝑟 𝑊𝑃𝑟) ↔ (¬ 𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
289, 27syl5bb 286 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → ((𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ (¬ 𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
29283expa 1115 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) ∧ 𝑟𝐴) → ((𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ (¬ 𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
3029rexbidva 3258 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → (∃𝑟𝐴 (𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
318, 30mpbid 235 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
32 simpl1 1188 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → (𝐾 ∈ HL ∧ 𝑊𝐻))
33 simpl2 1189 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
34 simpl3 1190 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
35 simpr 488 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → 𝑃𝑄)
363, 4, 5, 6cdlemb2 37330 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
3732, 33, 34, 35, 36syl121anc 1372 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
3831, 37pm2.61dane 3077 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  w3a 1084   = wceq 1538  wcel 2112  wne 2990  wrex 3110   class class class wbr 5033  cfv 6328  (class class class)co 7139  lecple 16567  joincjn 17549  Atomscatm 36552  AtLatcal 36553  HLchlt 36639  LHypclh 37273
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-rep 5157  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7445
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-ral 3114  df-rex 3115  df-reu 3116  df-rab 3118  df-v 3446  df-sbc 3724  df-csb 3832  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-pw 4502  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-iun 4886  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5428  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-riota 7097  df-ov 7142  df-oprab 7143  df-proset 17533  df-poset 17551  df-plt 17563  df-lub 17579  df-glb 17580  df-join 17581  df-meet 17582  df-p0 17644  df-p1 17645  df-lat 17651  df-clat 17713  df-oposet 36465  df-ol 36467  df-oml 36468  df-covers 36555  df-ats 36556  df-atl 36587  df-cvlat 36611  df-hlat 36640  df-lhyp 37277
This theorem is referenced by:  cdlemg6e  37911
  Copyright terms: Public domain W3C validator