Theorem 4atex2-0cOLDN 41137

Description: Same as 4atex2 41134 except that 𝑆 and 𝑇 are zero. TODO: do we need this one or 4atex2-0aOLDN 41135 or 4atex2-0bOLDN 41136? (Contributed by NM, 27-May-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
4that.l	⊢ ≤ = (le‘𝐾)
4that.j	⊢ ∨ = (join‘𝐾)
4that.a	⊢ 𝐴 = (Atoms‘𝐾)
4that.h	⊢ 𝐻 = (LHyp‘𝐾)

Assertion

Ref	Expression
4atex2-0cOLDN	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 = (0.‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 = (0.‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑆 ∨ 𝑧) = (𝑇 ∨ 𝑧)))

Distinct variable groups:   𝑧,𝑟,𝐴   𝐻,𝑟   ∨ ,𝑟,𝑧   𝐾,𝑟,𝑧   ≤ ,𝑟,𝑧   𝑃,𝑟,𝑧   𝑄,𝑟,𝑧   𝑆,𝑟,𝑧   𝑊,𝑟,𝑧   𝑇,𝑟,𝑧   𝑧,𝐻

Proof of Theorem 4atex2-0cOLDN

Step	Hyp	Ref	Expression
1		simp21l 1309	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 = (0.‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 = (0.‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑃 ∈ 𝐴)
2		simp21r 1310	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 = (0.‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 = (0.‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ¬ 𝑃 ≤ 𝑊)
3		simp23 1227	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 = (0.‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 = (0.‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑆 = (0.‘𝐾))
4	3	oveq1d 7435	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 = (0.‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 = (0.‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑆 ∨ 𝑃) = ((0.‘𝐾) ∨ 𝑃))
5		simp32 1229	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 = (0.‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 = (0.‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑇 = (0.‘𝐾))
6	5	oveq1d 7435	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 = (0.‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 = (0.‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑇 ∨ 𝑃) = ((0.‘𝐾) ∨ 𝑃))
7	4, 6	eqtr4d 2799	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 = (0.‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 = (0.‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑆 ∨ 𝑃) = (𝑇 ∨ 𝑃))
8		breq1 5106	. . . . 5 ⊢ (𝑧 = 𝑃 → (𝑧 ≤ 𝑊 ↔ 𝑃 ≤ 𝑊))
9	8	notbid 321	. . . 4 ⊢ (𝑧 = 𝑃 → (¬ 𝑧 ≤ 𝑊 ↔ ¬ 𝑃 ≤ 𝑊))
10		oveq2 7428	. . . . 5 ⊢ (𝑧 = 𝑃 → (𝑆 ∨ 𝑧) = (𝑆 ∨ 𝑃))
11		oveq2 7428	. . . . 5 ⊢ (𝑧 = 𝑃 → (𝑇 ∨ 𝑧) = (𝑇 ∨ 𝑃))
12	10, 11	eqeq12d 2777	. . . 4 ⊢ (𝑧 = 𝑃 → ((𝑆 ∨ 𝑧) = (𝑇 ∨ 𝑧) ↔ (𝑆 ∨ 𝑃) = (𝑇 ∨ 𝑃)))
13	9, 12	anbi12d 644	. . 3 ⊢ (𝑧 = 𝑃 → ((¬ 𝑧 ≤ 𝑊 ∧ (𝑆 ∨ 𝑧) = (𝑇 ∨ 𝑧)) ↔ (¬ 𝑃 ≤ 𝑊 ∧ (𝑆 ∨ 𝑃) = (𝑇 ∨ 𝑃))))
14	13	rspcev 3577	. 2 ⊢ ((𝑃 ∈ 𝐴 ∧ (¬ 𝑃 ≤ 𝑊 ∧ (𝑆 ∨ 𝑃) = (𝑇 ∨ 𝑃))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑆 ∨ 𝑧) = (𝑇 ∨ 𝑧)))
15	1, 2, 7, 14	syl12anc 850	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑆 = (0.‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑇 = (0.‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑆 ∨ 𝑧) = (𝑇 ∨ 𝑧)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∃wrex 3087   class class class wbr 5103  ‘cfv 6538  (class class class)co 7420  lecple 17435  joincjn 18485  0.cp0 18595  Atomscatm 40320  HLchlt 40407  LHypclh 41041

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6494  df-fv 6546  df-ov 7423

This theorem is used by: (None)