Theorem cdlemg17b 38603

Description: Part of proof of Lemma G in [Crawley] p. 117, 4th line. Whenever (in their terminology) p ∨ q/0 (i.e. the sublattice from 0 to p ∨ q) contains precisely three atoms and g is not the identity, g(p) = q. See also comments under cdleme0nex 38231. (Contributed by NM, 8-May-2013.)

Hypotheses

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

Assertion

Ref	Expression
cdlemg17b	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘𝑃) = 𝑄)

Distinct variable groups:   𝐴,𝑟   𝐺,𝑟   ∨ ,𝑟   ≤ ,𝑟   𝑃,𝑟   𝑄,𝑟   𝑊,𝑟

Allowed substitution hints:   𝑅(𝑟)   𝑇(𝑟)   𝐻(𝑟)   𝐾(𝑟)   ∧ (𝑟)

Proof of Theorem cdlemg17b

Step	Hyp	Ref	Expression
1		simp31 1207	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘𝑃) ≠ 𝑃)
2	1	neneqd 2947	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ¬ (𝐺‘𝑃) = 𝑃)
3		simp11l 1282	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝐾 ∈ HL)
4		simp11 1201	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
5		simp12 1202	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
6		simp13 1203	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
7		simp2l 1197	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝐺 ∈ 𝑇)
8		simp32 1208	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))
9		cdlemg12.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
10		cdlemg12.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
11		cdlemg12.m	. . . . . 6 ⊢ ∧ = (meet‘𝐾)
12		cdlemg12.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
13		cdlemg12.h	. . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾)
14		cdlemg12.t	. . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
15		cdlemg12b.r	. . . . . 6 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
16	9, 10, 11, 12, 13, 14, 15	cdlemg17a 38602	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) → (𝐺‘𝑃) ≤ (𝑃 ∨ 𝑄))
17	4, 5, 6, 7, 8, 16	syl122anc 1377	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘𝑃) ≤ (𝑃 ∨ 𝑄))
18		simp33 1209	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))
19		simp12l 1284	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑃 ∈ 𝐴)
20		simp13l 1286	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑄 ∈ 𝐴)
21		simp2r 1198	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑃 ≠ 𝑄)
22	9, 12, 13, 14	ltrnel 38080	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺‘𝑃) ∈ 𝐴 ∧ ¬ (𝐺‘𝑃) ≤ 𝑊))
23	4, 7, 5, 22	syl3anc 1369	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝐺‘𝑃) ∈ 𝐴 ∧ ¬ (𝐺‘𝑃) ≤ 𝑊))
24	9, 10, 12	cdleme0nex 38231	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝐺‘𝑃) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟))) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ∈ 𝐴 ∧ ¬ (𝐺‘𝑃) ≤ 𝑊)) → ((𝐺‘𝑃) = 𝑃 ∨ (𝐺‘𝑃) = 𝑄))
25	3, 17, 18, 19, 20, 21, 23, 24	syl331anc 1393	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝐺‘𝑃) = 𝑃 ∨ (𝐺‘𝑃) = 𝑄))
26	25	ord 860	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (¬ (𝐺‘𝑃) = 𝑃 → (𝐺‘𝑃) = 𝑄))
27	2, 26	mpd 15	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘𝑃) = 𝑄)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 843   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ∃wrex 3064   class class class wbr 5070  ‘cfv 6418  (class class class)co 7255  lecple 16895  joincjn 17944  meetcmee 17945  Atomscatm 37204  HLchlt 37291  LHypclh 37925  LTrncltrn 38042  trLctrl 38099

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-map 8575  df-proset 17928  df-poset 17946  df-plt 17963  df-lub 17979  df-glb 17980  df-join 17981  df-meet 17982  df-p0 18058  df-p1 18059  df-lat 18065  df-clat 18132  df-oposet 37117  df-ol 37119  df-oml 37120  df-covers 37207  df-ats 37208  df-atl 37239  df-cvlat 37263  df-hlat 37292  df-psubsp 37444  df-pmap 37445  df-padd 37737  df-lhyp 37929  df-laut 37930  df-ldil 38045  df-ltrn 38046  df-trl 38100

This theorem is referenced by:  cdlemg17dN  38604  cdlemg17e  38606  cdlemg17ir  38611  cdlemg17bq  38614  cdlemg17  38618  cdlemg18d  38622