Theorem cdleme0ex2N 41547

Description: Part of proof of Lemma E in [Crawley] p. 113. Note that (𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) is a shorter way to express 𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄 ∧ 𝑢 ≤ (𝑃 ∨ 𝑄). (Contributed by NM, 9-Nov-2012.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cdleme0.l	⊢ ≤ = (le‘𝐾)
cdleme0.j	⊢ ∨ = (join‘𝐾)
cdleme0.m	⊢ ∧ = (meet‘𝐾)
cdleme0.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme0.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme0.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)

Assertion

Ref	Expression
cdleme0ex2N	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → ∃𝑢 ∈ 𝐴 ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ∧ 𝑢 ≤ 𝑊))

Distinct variable groups:   𝑢,𝐴   𝑢, ∨   𝑢, ≤   𝑢,𝑃   𝑢,𝑄   𝑢,𝑈   𝑢,𝑊   𝑢,𝐻   𝑢,𝐾

Allowed substitution hint:   ∧ (𝑢)

Proof of Theorem cdleme0ex2N

Step	Hyp	Ref	Expression
1		simp1 1154	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp2l 1218	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
3		simp2rl 1261	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ 𝐴)
4		simp3 1156	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → 𝑃 ≠ 𝑄)
5		cdleme0.l	. . . 4 ⊢ ≤ = (le‘𝐾)
6		cdleme0.j	. . . 4 ⊢ ∨ = (join‘𝐾)
7		cdleme0.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
8		cdleme0.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
9		cdleme0.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
10		cdleme0.u	. . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
11	5, 6, 7, 8, 9, 10	cdleme0ex1N 41546	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → ∃𝑢 ∈ 𝐴 (𝑢 ≤ (𝑃 ∨ 𝑄) ∧ 𝑢 ≤ 𝑊))
12	1, 2, 3, 4, 11	syl121anc 1403	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → ∃𝑢 ∈ 𝐴 (𝑢 ≤ (𝑃 ∨ 𝑄) ∧ 𝑢 ≤ 𝑊))
13		simp11l 1303	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝐾 ∈ HL)
14		hlcvl 40682	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CvLat)
15	13, 14	syl 18	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝐾 ∈ CvLat)
16		simp2ll 1259	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → 𝑃 ∈ 𝐴)
17	16	3ad2ant1 1151	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑃 ∈ 𝐴)
18	3	3ad2ant1 1151	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑄 ∈ 𝐴)
19		simp2 1155	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑢 ∈ 𝐴)
20		simp13 1224	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑃 ≠ 𝑄)
21	8, 5, 6	cvlsupr2 40666	. . . . . . 7 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑢 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ↔ (𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄 ∧ 𝑢 ≤ (𝑃 ∨ 𝑄))))
22	15, 17, 18, 19, 20, 21	syl131anc 1411	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ↔ (𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄 ∧ 𝑢 ≤ (𝑃 ∨ 𝑄))))
23		df-3an 1105	. . . . . . 7 ⊢ ((𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄 ∧ 𝑢 ≤ (𝑃 ∨ 𝑄)) ↔ ((𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄) ∧ 𝑢 ≤ (𝑃 ∨ 𝑄)))
24		simp3 1156	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑢 ≤ 𝑊)
25		simp2lr 1260	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → ¬ 𝑃 ≤ 𝑊)
26	25	3ad2ant1 1151	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ¬ 𝑃 ≤ 𝑊)
27		nbrne2 5131	. . . . . . . . . 10 ⊢ ((𝑢 ≤ 𝑊 ∧ ¬ 𝑃 ≤ 𝑊) → 𝑢 ≠ 𝑃)
28	24, 26, 27	syl2anc 596	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑢 ≠ 𝑃)
29		simp2rr 1262	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → ¬ 𝑄 ≤ 𝑊)
30	29	3ad2ant1 1151	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ¬ 𝑄 ≤ 𝑊)
31		nbrne2 5131	. . . . . . . . . 10 ⊢ ((𝑢 ≤ 𝑊 ∧ ¬ 𝑄 ≤ 𝑊) → 𝑢 ≠ 𝑄)
32	24, 30, 31	syl2anc 596	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑢 ≠ 𝑄)
33	28, 32	jca 521	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → (𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄))
34	33	biantrurd 542	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → (𝑢 ≤ (𝑃 ∨ 𝑄) ↔ ((𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄) ∧ 𝑢 ≤ (𝑃 ∨ 𝑄))))
35	23, 34	bitr4id 293	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ((𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄 ∧ 𝑢 ≤ (𝑃 ∨ 𝑄)) ↔ 𝑢 ≤ (𝑃 ∨ 𝑄)))
36	22, 35	bitrd 282	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ↔ 𝑢 ≤ (𝑃 ∨ 𝑄)))
37	36	3expia 1139	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴) → (𝑢 ≤ 𝑊 → ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ↔ 𝑢 ≤ (𝑃 ∨ 𝑄))))
38	37	pm5.32rd 589	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴) → (((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ∧ 𝑢 ≤ 𝑊) ↔ (𝑢 ≤ (𝑃 ∨ 𝑄) ∧ 𝑢 ≤ 𝑊)))
39	38	rexbidva 3188	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → (∃𝑢 ∈ 𝐴 ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ∧ 𝑢 ≤ 𝑊) ↔ ∃𝑢 ∈ 𝐴 (𝑢 ≤ (𝑃 ∨ 𝑄) ∧ 𝑢 ≤ 𝑊)))
40	12, 39	mpbird 260	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → ∃𝑢 ∈ 𝐴 ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ∧ 𝑢 ≤ 𝑊))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  lecple 17479  joincjn 18535  meetcmee 18536  Atomscatm 40586  CvLatclc 40588  HLchlt 40673  LHypclh 41307

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-proset 18518  df-poset 18537  df-plt 18552  df-lub 18568  df-glb 18569  df-join 18570  df-meet 18571  df-p0 18647  df-p1 18648  df-lat 18656  df-clat 18723  df-oposet 40499  df-ol 40501  df-oml 40502  df-covers 40589  df-ats 40590  df-atl 40621  df-cvlat 40645  df-hlat 40674  df-lhyp 41311

This theorem is used by: (None)