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 41757
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 41156? Then replace cdlemb2 41192 with it. This is a more general version of cdlemb2 41192 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 41756 . . . 4 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ∃𝑟 ∈ 𝐴 (𝑃 ≠ 𝑟 ∧ ¬ 𝑟 ≤ 𝑊))
81, 2, 7syl2anc 596 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄) → ∃𝑟 ∈ 𝐴 (𝑃 ≠ 𝑟 ∧ ¬ 𝑟 ≤ 𝑊))
9 ancom 466 . . . . . 6 ((𝑃 ≠ 𝑟 ∧ ¬ 𝑟 ≤ 𝑊) ↔ (¬ 𝑟 ≤ 𝑊 ∧ 𝑃 ≠ 𝑟))
10 eqcom 2767 . . . . . . . . 9 (𝑃 = 𝑟 ↔ 𝑟 = 𝑃)
11 simp2 1155 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄 ∧ 𝑟 ∈ 𝐴) → 𝑃 = 𝑄)
1211oveq2d 7437 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄 ∧ 𝑟 ∈ 𝐴) → (𝑃 ∨ 𝑃) = (𝑃 ∨ 𝑄))
13 simp11l 1303 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄 ∧ 𝑟 ∈ 𝐴) → 𝐾 ∈ HL)
14 simp12l 1305 . . . . . . . . . . . . 13 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄 ∧ 𝑟 ∈ 𝐴) → 𝑃 ∈ 𝐴)
154, 5hlatjidm 40520 . . . . . . . . . . . . 13 ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴) → (𝑃 ∨ 𝑃) = 𝑃)
1613, 14, 15syl2anc 596 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄 ∧ 𝑟 ∈ 𝐴) → (𝑃 ∨ 𝑃) = 𝑃)
1712, 16eqtr3d 2797 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄 ∧ 𝑟 ∈ 𝐴) → (𝑃 ∨ 𝑄) = 𝑃)
1817breq2d 5114 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄 ∧ 𝑟 ∈ 𝐴) → (𝑟 ≤ (𝑃 ∨ 𝑄) ↔ 𝑟 ≤ 𝑃))
19 hlatl 40511 . . . . . . . . . . . 12 (𝐾 ∈ HL → 𝐾 ∈ AtLat)
2013, 19syl 18 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄 ∧ 𝑟 ∈ 𝐴) → 𝐾 ∈ AtLat)
21 simp3 1156 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 = 𝑄 ∧ 𝑟 ∈ 𝐴) → 𝑟 ∈ 𝐴)
223, 5atcmp 40462 . . . . . . . . . . 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 41192 . . 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 1569   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086   class class class wbr 5102  ‘cfv 6539  (class class class)co 7421  lecple 17441  joincjn 18491  Atomscatm 40414  AtLatcal 40415  HLchlt 40501  LHypclh 41135
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-proset 18474  df-poset 18493  df-plt 18508  df-lub 18524  df-glb 18525  df-join 18526  df-meet 18527  df-p0 18603  df-p1 18604  df-lat 18612  df-clat 18679  df-oposet 40327  df-ol 40329  df-oml 40330  df-covers 40417  df-ats 40418  df-atl 40449  df-cvlat 40473  df-hlat 40502  df-lhyp 41139
This theorem is used by:  cdlemg6e  41773
  Copyright terms: Public domain W3C validator