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

Theorem 4atexlem7 37343
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 36611, our (𝑃 𝑟) = (𝑄 𝑟) is a shorter way to express 𝑟𝑃𝑟𝑄𝑟 (𝑃 𝑄). With a longer proof, the condition ¬ 𝑆 (𝑃 𝑄) could be eliminated (see 4atex 37344), 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 1281 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simp1r1 1266 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
323ad2ant1 1130 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
4 simp1r2 1267 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
543ad2ant1 1130 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
6 simp2 1134 . . . . . . 7 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → 𝑟𝐴)
7 simp3l 1198 . . . . . . 7 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → ¬ 𝑟 𝑊)
86, 7jca 515 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝑟𝐴 ∧ ¬ 𝑟 𝑊))
9 simp1r3 1268 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) → 𝑆𝐴)
1093ad2ant1 1130 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → 𝑆𝐴)
11 simp3r 1199 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → (𝑃 𝑟) = (𝑄 𝑟))
12 simp12 1201 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → 𝑃𝑄)
13 simp13 1202 . . . . . 6 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → ¬ 𝑆 (𝑃 𝑄))
14 4that.l . . . . . . 7 = (le‘𝐾)
15 4that.j . . . . . . 7 = (join‘𝐾)
16 eqid 2824 . . . . . . 7 (meet‘𝐾) = (meet‘𝐾)
17 4that.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
18 4that.h . . . . . . 7 𝐻 = (LHyp‘𝐾)
1914, 15, 16, 17, 184atexlemex6 37342 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑟𝐴 ∧ ¬ 𝑟 𝑊) ∧ 𝑆𝐴) ∧ ((𝑃 𝑟) = (𝑄 𝑟) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄))) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧)))
201, 3, 5, 8, 10, 11, 12, 13, 19syl323anc 1397 . . . . 5 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) ∧ 𝑟𝐴 ∧ (¬ 𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧)))
2120rexlimdv3a 3278 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) ∧ 𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄)) → (∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧))))
22213exp 1116 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) → (𝑃𝑄 → (¬ 𝑆 (𝑃 𝑄) → (∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧))))))
23223impd 1345 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴)) → ((𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄) ∧ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟))) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧))))
24233impia 1114 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ 𝑆𝐴) ∧ (𝑃𝑄 ∧ ¬ 𝑆 (𝑃 𝑄) ∧ ∃𝑟𝐴𝑟 𝑊 ∧ (𝑃 𝑟) = (𝑄 𝑟)))) → ∃𝑧𝐴𝑧 𝑊 ∧ (𝑃 𝑧) = (𝑆 𝑧)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  w3a 1084   = wceq 1538  wcel 2115  wne 3014  wrex 3134   class class class wbr 5053  cfv 6345  (class class class)co 7151  lecple 16574  joincjn 17556  meetcmee 17557  Atomscatm 36531  HLchlt 36618  LHypclh 37252
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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-rep 5177  ax-sep 5190  ax-nul 5197  ax-pow 5254  ax-pr 5318  ax-un 7457
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 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3015  df-ral 3138  df-rex 3139  df-reu 3140  df-rab 3142  df-v 3482  df-sbc 3759  df-csb 3867  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4277  df-if 4451  df-pw 4524  df-sn 4551  df-pr 4553  df-op 4557  df-uni 4825  df-iun 4907  df-br 5054  df-opab 5116  df-mpt 5134  df-id 5448  df-xp 5549  df-rel 5550  df-cnv 5551  df-co 5552  df-dm 5553  df-rn 5554  df-res 5555  df-ima 5556  df-iota 6304  df-fun 6347  df-fn 6348  df-f 6349  df-f1 6350  df-fo 6351  df-f1o 6352  df-fv 6353  df-riota 7109  df-ov 7154  df-oprab 7155  df-proset 17540  df-poset 17558  df-plt 17570  df-lub 17586  df-glb 17587  df-join 17588  df-meet 17589  df-p0 17651  df-p1 17652  df-lat 17658  df-clat 17720  df-oposet 36444  df-ol 36446  df-oml 36447  df-covers 36534  df-ats 36535  df-atl 36566  df-cvlat 36590  df-hlat 36619  df-llines 36766  df-lplanes 36767  df-lhyp 37256
This theorem is referenced by:  4atex  37344  cdleme21i  37603
  Copyright terms: Public domain W3C validator