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

Theorem 4atexlem7 34379
 Description: Whenever there are at least 4 atoms under 𝑃 ∨ 𝑄 (specifically, 𝑃, 𝑄, 𝑟, and (𝑃 ∨ 𝑄) ∧ 𝑊), there are also at least 4 atoms under 𝑃 ∨ 𝑆. This proves the statement in Lemma E of [Crawley] p. 114, last line, "...p ∨ q/0 and hence p ∨ s/0 contains at least four atoms..." Note that by cvlsupr2 33648, our (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟) is a shorter way to express 𝑟 ≠ 𝑃 ∧ 𝑟 ≠ 𝑄 ∧ 𝑟 ≤ (𝑃 ∨ 𝑄). With a longer proof, the condition ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) could be eliminated (see 4atex 34380), although for some purposes this more restricted lemma may be adequate. (Contributed by NM, 25-Nov-2012.)
Hypotheses
Ref Expression
4that.l = (le‘𝐾)
4that.j = (join‘𝐾)
4that.a 𝐴 = (Atoms‘𝐾)
4that.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
4atexlem7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄) ∧ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧)))
Distinct variable groups:   𝑧,𝑟,𝐴   𝐻,𝑟   ,𝑟,𝑧   𝐾,𝑟,𝑧   ,𝑟,𝑧   𝑃,𝑟,𝑧   𝑄,𝑟,𝑧   𝑆,𝑟,𝑧   𝑊,𝑟,𝑧
Allowed substitution hint:   𝐻(𝑧)

Proof of Theorem 4atexlem7
StepHypRef Expression
1 simp11l 1165 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simp1r1 1150 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
323ad2ant1 1075 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
4 simp1r2 1151 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
543ad2ant1 1075 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
6 simp2 1055 . . . . . . 7 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → 𝑟𝐴)
7 simp3l 1082 . . . . . . 7 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → ¬ 𝑟 𝑊)
86, 7jca 553 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝑟𝐴 ∧ ¬ 𝑟 𝑊))
9 simp1r3 1152 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) → 𝑆𝐴)
1093ad2ant1 1075 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → 𝑆𝐴)
11 simp3r 1083 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝑃 𝑟) = (𝑄 𝑟))
12 simp12 1085 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → 𝑃𝑄)
13 simp13 1086 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → ¬ 𝑆 (𝑃 𝑄))
14 4that.l . . . . . . 7 = (le‘𝐾)
15 4that.j . . . . . . 7 = (join‘𝐾)
16 eqid 2610 . . . . . . 7 (meet‘𝐾) = (meet‘𝐾)
17 4that.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
18 4that.h . . . . . . 7 𝐻 = (LHyp‘𝐾)
1914, 15, 16, 17, 184atexlemex6 34378 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑟𝐴 ∧ ¬ 𝑟 𝑊) ∧ 𝑆𝐴) ∧ ((𝑃 𝑟) = (𝑄 𝑟) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧)))
201, 3, 5, 8, 10, 11, 12, 13, 19syl323anc 1348 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧)))
2120rexlimdv3a 3015 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) → (∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧))))
22213exp 1256 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) → (𝑃𝑄 → (¬ 𝑆 (𝑃 𝑄) → (∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧))))))
23223impd 1273 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) → ((𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄) ∧ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧))))
24233impia 1253 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄) ∧ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∃wrex 2897   class class class wbr 4583  ‘cfv 5804  (class class class)co 6549  lecple 15775  joincjn 16767  meetcmee 16768  Atomscatm 33568  HLchlt 33655  LHypclh 34288 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-preset 16751  df-poset 16769  df-plt 16781  df-lub 16797  df-glb 16798  df-join 16799  df-meet 16800  df-p0 16862  df-p1 16863  df-lat 16869  df-clat 16931  df-oposet 33481  df-ol 33483  df-oml 33484  df-covers 33571  df-ats 33572  df-atl 33603  df-cvlat 33627  df-hlat 33656  df-llines 33802  df-lplanes 33803  df-lhyp 34292 This theorem is referenced by:  4atex  34380  cdleme21i  34641
 Copyright terms: Public domain W3C validator