colline - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > colline		Structured version Visualization version GIF version

Theorem colline 28452

Description: Three points are colinear iff there is a line through all three of them. Theorem 6.23 of [Schwabhauser] p. 46. (Contributed by Thierry Arnoux, 28-May-2019.)

**Hypotheses**
Ref	Expression
tglineintmo.p	⊢ 𝑃 = (Base‘𝐺)
tglineintmo.i	⊢ 𝐼 = (Itv‘𝐺)
tglineintmo.l	⊢ 𝐿 = (LineG‘𝐺)
tglineintmo.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
colline.1	⊢ (𝜑 → 𝑋 ∈ 𝑃)
colline.2	⊢ (𝜑 → 𝑌 ∈ 𝑃)
colline.3	⊢ (𝜑 → 𝑍 ∈ 𝑃)
colline.4	⊢ (𝜑 → 2 ≤ (♯‘𝑃))

**Assertion**
Ref	Expression
colline	⊢ (𝜑 → ((𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍) ↔ ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)))

Distinct variable groups: 𝐿,𝑎 𝑋,𝑎 𝑌,𝑎 𝑍,𝑎 𝜑,𝑎 Allowed substitution hints: 𝑃(𝑎) 𝐺(𝑎) 𝐼(𝑎)

Proof of Theorem colline Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		tglineintmo.p	. . . . . . . 8 ⊢ 𝑃 = (Base‘𝐺)
2		tglineintmo.i	. . . . . . . 8 ⊢ 𝐼 = (Itv‘𝐺)
3		tglineintmo.l	. . . . . . . 8 ⊢ 𝐿 = (LineG‘𝐺)
4		tglineintmo.g	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	ad4antr 731	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝐺 ∈ TarskiG)
6		colline.1	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
7	6	ad4antr 731	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑋 ∈ 𝑃)
8		simplr 768	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑥 ∈ 𝑃)
9		simpr 484	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑋 ≠ 𝑥)
10	1, 2, 3, 5, 7, 8, 9	tgelrnln 28433	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → (𝑋𝐿𝑥) ∈ ran 𝐿)
11	1, 2, 3, 5, 7, 8, 9	tglinerflx1 28436	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑋 ∈ (𝑋𝐿𝑥))
12		simp-4r 783	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑌 = 𝑍)
13		simpllr 775	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑋 = 𝑍)
14	13, 11	eqeltrrd 2830	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑍 ∈ (𝑋𝐿𝑥))
15	12, 14	eqeltrd 2829	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑌 ∈ (𝑋𝐿𝑥))
16		eleq2 2818	. . . . . . . . 9 ⊢ (𝑎 = (𝑋𝐿𝑥) → (𝑋 ∈ 𝑎 ↔ 𝑋 ∈ (𝑋𝐿𝑥)))
17		eleq2 2818	. . . . . . . . 9 ⊢ (𝑎 = (𝑋𝐿𝑥) → (𝑌 ∈ 𝑎 ↔ 𝑌 ∈ (𝑋𝐿𝑥)))
18		eleq2 2818	. . . . . . . . 9 ⊢ (𝑎 = (𝑋𝐿𝑥) → (𝑍 ∈ 𝑎 ↔ 𝑍 ∈ (𝑋𝐿𝑥)))
19	16, 17, 18	3anbi123d 1433	. . . . . . . 8 ⊢ (𝑎 = (𝑋𝐿𝑥) → ((𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎) ↔ (𝑋 ∈ (𝑋𝐿𝑥) ∧ 𝑌 ∈ (𝑋𝐿𝑥) ∧ 𝑍 ∈ (𝑋𝐿𝑥))))
20	19	rspcev 3609	. . . . . . 7 ⊢ (((𝑋𝐿𝑥) ∈ ran 𝐿 ∧ (𝑋 ∈ (𝑋𝐿𝑥) ∧ 𝑌 ∈ (𝑋𝐿𝑥) ∧ 𝑍 ∈ (𝑋𝐿𝑥))) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
21	10, 11, 15, 14, 20	syl13anc 1370	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
22		eqid 2728	. . . . . . . 8 ⊢ (dist‘𝐺) = (dist‘𝐺)
23		colline.4	. . . . . . . 8 ⊢ (𝜑 → 2 ≤ (♯‘𝑃))
24	1, 22, 2, 4, 23, 6	tglowdim1i 28304	. . . . . . 7 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 𝑋 ≠ 𝑥)
25	24	ad2antrr 725	. . . . . 6 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) → ∃𝑥 ∈ 𝑃 𝑋 ≠ 𝑥)
26	21, 25	r19.29a 3159	. . . . 5 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
27	4	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝐺 ∈ TarskiG)
28	6	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑋 ∈ 𝑃)
29		colline.3	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ∈ 𝑃)
30	29	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑍 ∈ 𝑃)
31		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑋 ≠ 𝑍)
32	1, 2, 3, 27, 28, 30, 31	tgelrnln 28433	. . . . . 6 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → (𝑋𝐿𝑍) ∈ ran 𝐿)
33	1, 2, 3, 27, 28, 30, 31	tglinerflx1 28436	. . . . . 6 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑋 ∈ (𝑋𝐿𝑍))
34		simplr 768	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑌 = 𝑍)
35	1, 2, 3, 27, 28, 30, 31	tglinerflx2 28437	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑍 ∈ (𝑋𝐿𝑍))
36	34, 35	eqeltrd 2829	. . . . . 6 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑌 ∈ (𝑋𝐿𝑍))
37		eleq2 2818	. . . . . . . 8 ⊢ (𝑎 = (𝑋𝐿𝑍) → (𝑋 ∈ 𝑎 ↔ 𝑋 ∈ (𝑋𝐿𝑍)))
38		eleq2 2818	. . . . . . . 8 ⊢ (𝑎 = (𝑋𝐿𝑍) → (𝑌 ∈ 𝑎 ↔ 𝑌 ∈ (𝑋𝐿𝑍)))
39		eleq2 2818	. . . . . . . 8 ⊢ (𝑎 = (𝑋𝐿𝑍) → (𝑍 ∈ 𝑎 ↔ 𝑍 ∈ (𝑋𝐿𝑍)))
40	37, 38, 39	3anbi123d 1433	. . . . . . 7 ⊢ (𝑎 = (𝑋𝐿𝑍) → ((𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎) ↔ (𝑋 ∈ (𝑋𝐿𝑍) ∧ 𝑌 ∈ (𝑋𝐿𝑍) ∧ 𝑍 ∈ (𝑋𝐿𝑍))))
41	40	rspcev 3609	. . . . . 6 ⊢ (((𝑋𝐿𝑍) ∈ ran 𝐿 ∧ (𝑋 ∈ (𝑋𝐿𝑍) ∧ 𝑌 ∈ (𝑋𝐿𝑍) ∧ 𝑍 ∈ (𝑋𝐿𝑍))) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
42	32, 33, 36, 35, 41	syl13anc 1370	. . . . 5 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
43	26, 42	pm2.61dane 3026	. . . 4 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
44	43	adantlr 714	. . 3 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 = 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
45		simpll 766	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝜑)
46		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ≠ 𝑍)
47	46	neneqd 2942	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → ¬ 𝑌 = 𝑍)
48		simplr 768	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍))
49		orel2 889	. . . . . 6 ⊢ (¬ 𝑌 = 𝑍 → ((𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍) → 𝑋 ∈ (𝑌𝐿𝑍)))
50	47, 48, 49	sylc 65	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑋 ∈ (𝑌𝐿𝑍))
51	4	ad2antrr 725	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝐺 ∈ TarskiG)
52		colline.2	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
53	52	ad2antrr 725	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ 𝑃)
54	29	ad2antrr 725	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ 𝑃)
55		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ≠ 𝑍)
56	1, 2, 3, 51, 53, 54, 55	tgelrnln 28433	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → (𝑌𝐿𝑍) ∈ ran 𝐿)
57	45, 50, 46, 56	syl21anc 837	. . . 4 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → (𝑌𝐿𝑍) ∈ ran 𝐿)
58	1, 2, 3, 51, 53, 54, 55	tglinerflx1 28436	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ (𝑌𝐿𝑍))
59	45, 50, 46, 58	syl21anc 837	. . . 4 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ (𝑌𝐿𝑍))
60	1, 2, 3, 51, 53, 54, 55	tglinerflx2 28437	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ (𝑌𝐿𝑍))
61	45, 50, 46, 60	syl21anc 837	. . . 4 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ (𝑌𝐿𝑍))
62		eleq2 2818	. . . . . 6 ⊢ (𝑎 = (𝑌𝐿𝑍) → (𝑋 ∈ 𝑎 ↔ 𝑋 ∈ (𝑌𝐿𝑍)))
63		eleq2 2818	. . . . . 6 ⊢ (𝑎 = (𝑌𝐿𝑍) → (𝑌 ∈ 𝑎 ↔ 𝑌 ∈ (𝑌𝐿𝑍)))
64		eleq2 2818	. . . . . 6 ⊢ (𝑎 = (𝑌𝐿𝑍) → (𝑍 ∈ 𝑎 ↔ 𝑍 ∈ (𝑌𝐿𝑍)))
65	62, 63, 64	3anbi123d 1433	. . . . 5 ⊢ (𝑎 = (𝑌𝐿𝑍) → ((𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎) ↔ (𝑋 ∈ (𝑌𝐿𝑍) ∧ 𝑌 ∈ (𝑌𝐿𝑍) ∧ 𝑍 ∈ (𝑌𝐿𝑍))))
66	65	rspcev 3609	. . . 4 ⊢ (((𝑌𝐿𝑍) ∈ ran 𝐿 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∧ 𝑌 ∈ (𝑌𝐿𝑍) ∧ 𝑍 ∈ (𝑌𝐿𝑍))) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
67	57, 50, 59, 61, 66	syl13anc 1370	. . 3 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
68	44, 67	pm2.61dane 3026	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
69		df-ne 2938	. . . . . 6 ⊢ (𝑌 ≠ 𝑍 ↔ ¬ 𝑌 = 𝑍)
70		simplr1 1213	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑋 ∈ 𝑎)
71	4	ad3antrrr 729	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝐺 ∈ TarskiG)
72	52	ad3antrrr 729	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ 𝑃)
73	29	ad3antrrr 729	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ 𝑃)
74		simpr 484	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ≠ 𝑍)
75		simpllr 775	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑎 ∈ ran 𝐿)
76		simplr2 1214	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ 𝑎)
77		simplr3 1215	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ 𝑎)
78	1, 2, 3, 71, 72, 73, 74, 74, 75, 76, 77	tglinethru 28439	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑎 = (𝑌𝐿𝑍))
79	70, 78	eleqtrd 2831	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑋 ∈ (𝑌𝐿𝑍))
80	79	ex 412	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (𝑌 ≠ 𝑍 → 𝑋 ∈ (𝑌𝐿𝑍)))
81	69, 80	biimtrrid 242	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (¬ 𝑌 = 𝑍 → 𝑋 ∈ (𝑌𝐿𝑍)))
82	81	orrd 862	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (𝑌 = 𝑍 ∨ 𝑋 ∈ (𝑌𝐿𝑍)))
83	82	orcomd 870	. . 3 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍))
84	83	r19.29an 3155	. 2 ⊢ ((𝜑 ∧ ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍))
85	68, 84	impbida 800	1 ⊢ (𝜑 → ((𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍) ↔ ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 846 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ≠ wne 2937 ∃wrex 3067 class class class wbr 5148 ran crn 5679 ‘cfv 6548 (class class class)co 7420 ≤ cle 11279 2c2 12297 ♯chash 14321 Basecbs 17179 distcds 17241 TarskiGcstrkg 28230 Itvcitv 28236 LineGclng 28237

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4909 df-int 4950 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-riota 7376 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7871 df-1st 7993 df-2nd 7994 df-frecs 8286 df-wrecs 8317 df-recs 8391 df-rdg 8430 df-1o 8486 df-oadd 8490 df-er 8724 df-pm 8847 df-en 8964 df-dom 8965 df-sdom 8966 df-fin 8967 df-dju 9924 df-card 9962 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-n0 12503 df-xnn0 12575 df-z 12589 df-uz 12853 df-fz 13517 df-fzo 13660 df-hash 14322 df-word 14497 df-concat 14553 df-s1 14578 df-s2 14831 df-s3 14832 df-trkgc 28251 df-trkgb 28252 df-trkgcb 28253 df-trkg 28256 df-cgrg 28314

This theorem is referenced by: (None)

W3C validator