Theorem 4atexlem7 40877

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 40145, our (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟) is a shorter way to express 𝑟 ≠ 𝑃 ∧ 𝑟 ≠ 𝑄 ∧ 𝑟 ≤ (𝑃 ∨ 𝑄). With a longer proof, the condition ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) could be eliminated (see 4atex 40878), 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

Step	Hyp	Ref	Expression
1		simp11l 1302	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp1r1 1287	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
3	2	3ad2ant1 1150	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
4		simp1r2 1288	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
5	4	3ad2ant1 1150	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
6		simp2 1154	. . . . . . 7 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → 𝑟 ∈ 𝐴)
7		simp3l 1219	. . . . . . 7 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → ¬ 𝑟 ≤ 𝑊)
8	6, 7	jca 520	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → (𝑟 ∈ 𝐴 ∧ ¬ 𝑟 ≤ 𝑊))
9		simp1r3 1289	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → 𝑆 ∈ 𝐴)
10	9	3ad2ant1 1150	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → 𝑆 ∈ 𝐴)
11		simp3r 1220	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))
12		simp12 1222	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → 𝑃 ≠ 𝑄)
13		simp13 1223	. . . . . 6 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))
14		4that.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
15		4that.j	. . . . . . 7 ⊢ ∨ = (join‘𝐾)
16		eqid 2762	. . . . . . 7 ⊢ (meet‘𝐾) = (meet‘𝐾)
17		4that.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
18		4that.h	. . . . . . 7 ⊢ 𝐻 = (LHyp‘𝐾)
19	14, 15, 16, 17, 18	4atexlemex6 40876	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑟 ∈ 𝐴 ∧ ¬ 𝑟 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴) ∧ ((𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧)))
20	1, 3, 5, 8, 10, 11, 12, 13, 19	syl323anc 1426	. . . . 5 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑟 ∈ 𝐴 ∧ (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧)))
21	20	rexlimdv3a 3169	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → (∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))))
22	21	3exp 1136	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) → (𝑃 ≠ 𝑄 → (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) → (∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))))))
23	22	3impd 1366	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))))
24	23	3impia 1134	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 ∈ 𝐴) ∧ (𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142   ≠ wne 2957  ∃wrex 3088   class class class wbr 5108  ‘cfv 6536  (class class class)co 7412  lecple 17323  joincjn 18373  meetcmee 18374  Atomscatm 40065  HLchlt 40152  LHypclh 40786

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7369  df-ov 7415  df-oprab 7416  df-proset 18356  df-poset 18375  df-plt 18390  df-lub 18406  df-glb 18407  df-join 18408  df-meet 18409  df-p0 18485  df-p1 18486  df-lat 18494  df-clat 18561  df-oposet 39978  df-ol 39980  df-oml 39981  df-covers 40068  df-ats 40069  df-atl 40100  df-cvlat 40124  df-hlat 40153  df-llines 40300  df-lplanes 40301  df-lhyp 40790

This theorem is used by:  4atex  40878  cdleme21i  41137