Theorem cdlemg16 40644

Description: Part of proof of Lemma G of [Crawley] p. 116; 2nd line p. 117, which says that (our) cdlemg10 40628 "implies (2)" (of p. 116). No details are provided by the authors, so there may be a shorter proof; but ours requires the 14 lemmas, one using Desargues's law dalaw 39873, in order to make this inference. This final step eliminates the (𝑅‘𝐹) ≠ (𝑅‘𝐺) condition from cdlemg12 40637. TODO: FIX COMMENT. TODO: should we also eliminate 𝑃 ≠ 𝑄 here (or earlier)? Do it if we don't need to add it in for something else later. (Contributed by NM, 6-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
cdlemg16	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))

Proof of Theorem cdlemg16

Step	Hyp	Ref	Expression
1		simpl1 1192	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
2		simpl21 1252	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) → 𝐹 ∈ 𝑇)
3		simpl22 1253	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) → 𝐺 ∈ 𝑇)
4		simpr 484	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) → (𝑅‘𝐹) = (𝑅‘𝐺))
5		cdlemg12.l	. . . 4 ⊢ ≤ = (le‘𝐾)
6		cdlemg12.j	. . . 4 ⊢ ∨ = (join‘𝐾)
7		cdlemg12.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
8		cdlemg12.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
9		cdlemg12.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
10		cdlemg12.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
11		cdlemg12b.r	. . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
12	5, 6, 7, 8, 9, 10, 11	cdlemg15 40643	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
13	1, 2, 3, 4, 12	syl121anc 1377	. 2 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
14		simpl1 1192	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
15		simpl2 1193	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄))
16		simpl31 1255	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → ¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄))
17		simpl32 1256	. . . 4 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))
18	16, 17	jca 511	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄)))
19		simpr 484	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘𝐹) ≠ (𝑅‘𝐺))
20		simpl33 1257	. . 3 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))
21	5, 6, 7, 8, 9, 10, 11	cdlemg12 40637	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄)) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
22	14, 15, 18, 19, 20, 21	syl113anc 1384	. 2 ⊢ (((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
23	13, 22	pm2.61dane 3012	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925   class class class wbr 5102  ‘cfv 6499  (class class class)co 7369  lecple 17203  joincjn 18252  meetcmee 18253  Atomscatm 39249  HLchlt 39336  LHypclh 39971  LTrncltrn 40088  trLctrl 40145

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-riotaBAD 38939

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-iin 4954  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-1st 7947  df-2nd 7948  df-undef 8229  df-map 8778  df-proset 18235  df-poset 18254  df-plt 18269  df-lub 18285  df-glb 18286  df-join 18287  df-meet 18288  df-p0 18364  df-p1 18365  df-lat 18373  df-clat 18440  df-oposet 39162  df-ol 39164  df-oml 39165  df-covers 39252  df-ats 39253  df-atl 39284  df-cvlat 39308  df-hlat 39337  df-llines 39485  df-lplanes 39486  df-lvols 39487  df-lines 39488  df-psubsp 39490  df-pmap 39491  df-padd 39783  df-lhyp 39975  df-laut 39976  df-ldil 40091  df-ltrn 40092  df-trl 40146

This theorem is referenced by:  cdlemg16z  40646