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 37736
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 37135? Then replace cdlemb2 37171 with it. This is a more general version of cdlemb2 37171 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 1187 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simpl2 1188 . . . 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 37735 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ∃𝑟𝐴 (𝑃𝑟 ∧ ¬ 𝑟 𝑊))
81, 2, 7syl2anc 586 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → ∃𝑟𝐴 (𝑃𝑟 ∧ ¬ 𝑟 𝑊))
9 ancom 463 . . . . . 6 ((𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ (¬ 𝑟 𝑊𝑃𝑟))
10 eqcom 2828 . . . . . . . . 9 (𝑃 = 𝑟𝑟 = 𝑃)
11 simp2 1133 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝑃 = 𝑄)
1211oveq2d 7166 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 𝑃) = (𝑃 𝑄))
13 simp11l 1280 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝐾 ∈ HL)
14 simp12l 1282 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝑃𝐴)
154, 5hlatjidm 36499 . . . . . . . . . . . . 13 ((𝐾 ∈ HL ∧ 𝑃𝐴) → (𝑃 𝑃) = 𝑃)
1613, 14, 15syl2anc 586 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 𝑃) = 𝑃)
1712, 16eqtr3d 2858 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 𝑄) = 𝑃)
1817breq2d 5071 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑟 (𝑃 𝑄) ↔ 𝑟 𝑃))
19 hlatl 36490 . . . . . . . . . . . 12 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
2013, 19syl 17 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝐾 ∈ AtLat)
21 simp3 1134 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → 𝑟𝐴)
223, 5atcmp 36441 . . . . . . . . . . 11 ((𝐾 ∈ AtLat ∧ 𝑟𝐴𝑃𝐴) → (𝑟 𝑃𝑟 = 𝑃))
2320, 21, 14, 22syl3anc 1367 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑟 𝑃𝑟 = 𝑃))
2418, 23bitr2d 282 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑟 = 𝑃𝑟 (𝑃 𝑄)))
2510, 24syl5bb 285 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃 = 𝑟𝑟 (𝑃 𝑄)))
2625necon3abid 3052 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → (𝑃𝑟 ↔ ¬ 𝑟 (𝑃 𝑄)))
2726anbi2d 630 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → ((¬ 𝑟 𝑊𝑃𝑟) ↔ (¬ 𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
289, 27syl5bb 285 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄𝑟𝐴) → ((𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ (¬ 𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
29283expa 1114 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) ∧ 𝑟𝐴) → ((𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ (¬ 𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
3029rexbidva 3296 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → (∃𝑟𝐴 (𝑃𝑟 ∧ ¬ 𝑟 𝑊) ↔ ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄))))
318, 30mpbid 234 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃 = 𝑄) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
32 simpl1 1187 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → (𝐾 ∈ HL ∧ 𝑊𝐻))
33 simpl2 1188 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
34 simpl3 1189 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
35 simpr 487 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → 𝑃𝑄)
363, 4, 5, 6cdlemb2 37171 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
3732, 33, 34, 35, 36syl121anc 1371 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
3831, 37pm2.61dane 3104 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ∃𝑟𝐴𝑟 𝑊 ∧ ¬ 𝑟 (𝑃 𝑄)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  w3a 1083   = wceq 1533  wcel 2110  wne 3016  wrex 3139   class class class wbr 5059  cfv 6350  (class class class)co 7150  lecple 16566  joincjn 17548  Atomscatm 36393  AtLatcal 36394  HLchlt 36480  LHypclh 37114
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-riota 7108  df-ov 7153  df-oprab 7154  df-proset 17532  df-poset 17550  df-plt 17562  df-lub 17578  df-glb 17579  df-join 17580  df-meet 17581  df-p0 17643  df-p1 17644  df-lat 17650  df-clat 17712  df-oposet 36306  df-ol 36308  df-oml 36309  df-covers 36396  df-ats 36397  df-atl 36428  df-cvlat 36452  df-hlat 36481  df-lhyp 37118
This theorem is referenced by:  cdlemg6e  37752
  Copyright terms: Public domain W3C validator