Theorem cdleme0ex2N 40716

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 1142	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp2l 1206	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
3		simp2rl 1249	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ 𝐴)
4		simp3 1144	. . 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 40715	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → ∃𝑢 ∈ 𝐴 (𝑢 ≤ (𝑃 ∨ 𝑄) ∧ 𝑢 ≤ 𝑊))
12	1, 2, 3, 4, 11	syl121anc 1383	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → ∃𝑢 ∈ 𝐴 (𝑢 ≤ (𝑃 ∨ 𝑄) ∧ 𝑢 ≤ 𝑊))
13		simp11l 1291	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝐾 ∈ HL)
14		hlcvl 39851	. . . . . . . 8 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CvLat)
15	13, 14	syl 17	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝐾 ∈ CvLat)
16		simp2ll 1247	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → 𝑃 ∈ 𝐴)
17	16	3ad2ant1 1139	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑃 ∈ 𝐴)
18	3	3ad2ant1 1139	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑄 ∈ 𝐴)
19		simp2 1143	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑢 ∈ 𝐴)
20		simp13 1212	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑃 ≠ 𝑄)
21	8, 5, 6	cvlsupr2 39835	. . . . . . 7 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑢 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ↔ (𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄 ∧ 𝑢 ≤ (𝑃 ∨ 𝑄))))
22	15, 17, 18, 19, 20, 21	syl131anc 1391	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ↔ (𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄 ∧ 𝑢 ≤ (𝑃 ∨ 𝑄))))
23		df-3an 1094	. . . . . . 7 ⊢ ((𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄 ∧ 𝑢 ≤ (𝑃 ∨ 𝑄)) ↔ ((𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄) ∧ 𝑢 ≤ (𝑃 ∨ 𝑄)))
24		simp3 1144	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑢 ≤ 𝑊)
25		simp2lr 1248	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → ¬ 𝑃 ≤ 𝑊)
26	25	3ad2ant1 1139	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ¬ 𝑃 ≤ 𝑊)
27		nbrne2 5092	. . . . . . . . . 10 ⊢ ((𝑢 ≤ 𝑊 ∧ ¬ 𝑃 ≤ 𝑊) → 𝑢 ≠ 𝑃)
28	24, 26, 27	syl2anc 590	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑢 ≠ 𝑃)
29		simp2rr 1250	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → ¬ 𝑄 ≤ 𝑊)
30	29	3ad2ant1 1139	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ¬ 𝑄 ≤ 𝑊)
31		nbrne2 5092	. . . . . . . . . 10 ⊢ ((𝑢 ≤ 𝑊 ∧ ¬ 𝑄 ≤ 𝑊) → 𝑢 ≠ 𝑄)
32	24, 30, 31	syl2anc 590	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → 𝑢 ≠ 𝑄)
33	28, 32	jca 516	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → (𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄))
34	33	biantrurd 537	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → (𝑢 ≤ (𝑃 ∨ 𝑄) ↔ ((𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄) ∧ 𝑢 ≤ (𝑃 ∨ 𝑄))))
35	23, 34	bitr4id 291	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ((𝑢 ≠ 𝑃 ∧ 𝑢 ≠ 𝑄 ∧ 𝑢 ≤ (𝑃 ∨ 𝑄)) ↔ 𝑢 ≤ (𝑃 ∨ 𝑄)))
36	22, 35	bitrd 280	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴 ∧ 𝑢 ≤ 𝑊) → ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ↔ 𝑢 ≤ (𝑃 ∨ 𝑄)))
37	36	3expia 1127	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴) → (𝑢 ≤ 𝑊 → ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ↔ 𝑢 ≤ (𝑃 ∨ 𝑄))))
38	37	pm5.32rd 583	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) ∧ 𝑢 ∈ 𝐴) → (((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ∧ 𝑢 ≤ 𝑊) ↔ (𝑢 ≤ (𝑃 ∨ 𝑄) ∧ 𝑢 ≤ 𝑊)))
39	38	rexbidva 3161	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → (∃𝑢 ∈ 𝐴 ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ∧ 𝑢 ≤ 𝑊) ↔ ∃𝑢 ∈ 𝐴 (𝑢 ≤ (𝑃 ∨ 𝑄) ∧ 𝑢 ≤ 𝑊)))
40	12, 39	mpbird 258	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄) → ∃𝑢 ∈ 𝐴 ((𝑃 ∨ 𝑢) = (𝑄 ∨ 𝑢) ∧ 𝑢 ≤ 𝑊))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   ∧ w3a 1092   = wceq 1547   ∈ wcel 2119   ≠ wne 2934  ∃wrex 3063   class class class wbr 5072  ‘cfv 6485  (class class class)co 7356  lecple 17218  joincjn 18268  meetcmee 18269  Atomscatm 39755  CvLatclc 39757  HLchlt 39842  LHypclh 40476

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-proset 18251  df-poset 18270  df-plt 18285  df-lub 18301  df-glb 18302  df-join 18303  df-meet 18304  df-p0 18380  df-p1 18381  df-lat 18389  df-clat 18456  df-oposet 39668  df-ol 39670  df-oml 39671  df-covers 39758  df-ats 39759  df-atl 39790  df-cvlat 39814  df-hlat 39843  df-lhyp 40480

This theorem is referenced by: (None)