cdlemg11b - Mathbox for Norm Megill

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

Theorem cdlemg11b 41965

Description: TODO: FIX COMMENT. (Contributed by NM, 5-May-2013.)

**Hypotheses**
Ref	Expression
cdlemg8.l	⊢ ≤ = (le‘𝐾)
cdlemg8.j	⊢ ∨ = (join‘𝐾)
cdlemg8.m	⊢ ∧ = (meet‘𝐾)
cdlemg8.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemg8.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemg8.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg10.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)

**Assertion**
Ref	Expression
cdlemg11b	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) → (𝑃 ∨ 𝑄) ≠ ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))

**Proof of Theorem cdlemg11b**
Step	Hyp	Ref	Expression
1		simp33 1230	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) → ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))
2		simpl1 1210	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
3		simpl31 1273	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝐺 ∈ 𝑇)
4		simpl2l 1245	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
5		cdlemg8.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
6		cdlemg8.j	. . . . . . 7 ⊢ ∨ = (join‘𝐾)
7		cdlemg8.m	. . . . . . 7 ⊢ ∧ = (meet‘𝐾)
8		cdlemg8.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
9		cdlemg8.h	. . . . . . 7 ⊢ 𝐻 = (LHyp‘𝐾)
10		cdlemg8.t	. . . . . . 7 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
11		cdlemg10.r	. . . . . . 7 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
12	5, 6, 7, 8, 9, 10, 11	trlval2 41486	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐺) = ((𝑃 ∨ (𝐺‘𝑃)) ∧ 𝑊))
13	2, 3, 4, 12	syl3anc 1399	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝑅‘𝐺) = ((𝑃 ∨ (𝐺‘𝑃)) ∧ 𝑊))
14		eqid 2763	. . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾)
15		simpl1l 1243	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝐾 ∈ HL)
16	15	hllatd 40687	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝐾 ∈ Lat)
17		simp2ll 1259	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) → 𝑃 ∈ 𝐴)
18	17	adantr 486	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝑃 ∈ 𝐴)
19	14, 8	atbase 40612	. . . . . . . . 9 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
20	18, 19	syl 18	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝑃 ∈ (Base‘𝐾))
21	14, 9, 10	ltrncl 41448	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ∈ (Base‘𝐾)) → (𝐺‘𝑃) ∈ (Base‘𝐾))
22	2, 3, 20, 21	syl3anc 1399	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝐺‘𝑃) ∈ (Base‘𝐾))
23	14, 6	latjcl 18663	. . . . . . . 8 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝐺‘𝑃) ∈ (Base‘𝐾)) → (𝑃 ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾))
24	16, 20, 22, 23	syl3anc 1399	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝑃 ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾))
25		simpl1r 1244	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝑊 ∈ 𝐻)
26	14, 9	lhpbase 41321	. . . . . . . 8 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾))
27	25, 26	syl 18	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝑊 ∈ (Base‘𝐾))
28	14, 7	latmcl 18664	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) → ((𝑃 ∨ (𝐺‘𝑃)) ∧ 𝑊) ∈ (Base‘𝐾))
29	16, 24, 27, 28	syl3anc 1399	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → ((𝑃 ∨ (𝐺‘𝑃)) ∧ 𝑊) ∈ (Base‘𝐾))
30		simpl2r 1246	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝑄 ∈ 𝐴)
31	14, 8	atbase 40612	. . . . . . . 8 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
32	30, 31	syl 18	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝑄 ∈ (Base‘𝐾))
33	14, 6	latjcl 18663	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
34	16, 20, 32, 33	syl3anc 1399	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
35	14, 5, 7	latmle1 18688	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ (𝐺‘𝑃)) ∈ (Base‘𝐾) ∧ 𝑊 ∈ (Base‘𝐾)) → ((𝑃 ∨ (𝐺‘𝑃)) ∧ 𝑊) ≤ (𝑃 ∨ (𝐺‘𝑃)))
36	16, 24, 27, 35	syl3anc 1399	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → ((𝑃 ∨ (𝐺‘𝑃)) ∧ 𝑊) ≤ (𝑃 ∨ (𝐺‘𝑃)))
37	14, 5, 6	latlej1 18672	. . . . . . . 8 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) → 𝑃 ≤ (𝑃 ∨ 𝑄))
38	16, 20, 32, 37	syl3anc 1399	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → 𝑃 ≤ (𝑃 ∨ 𝑄))
39	14, 9, 10	ltrncl 41448	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ∈ (Base‘𝐾)) → (𝐺‘𝑄) ∈ (Base‘𝐾))
40	2, 3, 32, 39	syl3anc 1399	. . . . . . . . 9 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝐺‘𝑄) ∈ (Base‘𝐾))
41	14, 5, 6	latlej1 18672	. . . . . . . . 9 ⊢ ((𝐾 ∈ Lat ∧ (𝐺‘𝑃) ∈ (Base‘𝐾) ∧ (𝐺‘𝑄) ∈ (Base‘𝐾)) → (𝐺‘𝑃) ≤ ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))
42	16, 22, 40, 41	syl3anc 1399	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝐺‘𝑃) ≤ ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))
43		simpr 490	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))
44	42, 43	breqtrrd 5139	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝐺‘𝑃) ≤ (𝑃 ∨ 𝑄))
45	14, 5, 6	latjle12 18674	. . . . . . . 8 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ (𝐺‘𝑃) ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑃 ∨ 𝑄) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ 𝑄)) ↔ (𝑃 ∨ (𝐺‘𝑃)) ≤ (𝑃 ∨ 𝑄)))
46	16, 20, 22, 34, 45	syl13anc 1400	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → ((𝑃 ≤ (𝑃 ∨ 𝑄) ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ 𝑄)) ↔ (𝑃 ∨ (𝐺‘𝑃)) ≤ (𝑃 ∨ 𝑄)))
47	38, 44, 46	mpbi2and 725	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝑃 ∨ (𝐺‘𝑃)) ≤ (𝑃 ∨ 𝑄))
48	14, 5, 16, 29, 24, 34, 36, 47	lattrd 18670	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → ((𝑃 ∨ (𝐺‘𝑃)) ∧ 𝑊) ≤ (𝑃 ∨ 𝑄))
49	13, 48	eqbrtrd 5133	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) ∧ (𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) → (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))
50	49	ex 418	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) → ((𝑃 ∨ 𝑄) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄)) → (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄)))
51	50	necon3bd 2973	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) → (¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) → (𝑃 ∨ 𝑄) ≠ ((𝐺‘𝑃) ∨ (𝐺‘𝑄))))
52	1, 51	mpd 16	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) → (𝑃 ∨ 𝑄) ≠ ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))

Colors of variables: wff setvar class

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

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-mpo 7456 df-map 8887 df-poset 18537 df-lub 18568 df-glb 18569 df-join 18570 df-meet 18571 df-lat 18656 df-ats 40590 df-atl 40621 df-cvlat 40645 df-hlat 40674 df-lhyp 41311 df-laut 41312 df-ldil 41427 df-ltrn 41428 df-trl 41482

This theorem is used by: cdlemg12b 41967

W3C validator