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 28393

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 729	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝐺 ∈ TarskiG)
6		colline.1	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
7	6	ad4antr 729	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑋 ∈ 𝑃)
8		simplr 766	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑥 ∈ 𝑃)
9		simpr 484	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑋 ≠ 𝑥)
10	1, 2, 3, 5, 7, 8, 9	tgelrnln 28374	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → (𝑋𝐿𝑥) ∈ ran 𝐿)
11	1, 2, 3, 5, 7, 8, 9	tglinerflx1 28377	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑋 ∈ (𝑋𝐿𝑥))
12		simp-4r 781	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑌 = 𝑍)
13		simpllr 773	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑋 = 𝑍)
14	13, 11	eqeltrrd 2826	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑍 ∈ (𝑋𝐿𝑥))
15	12, 14	eqeltrd 2825	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → 𝑌 ∈ (𝑋𝐿𝑥))
16		eleq2 2814	. . . . . . . . 9 ⊢ (𝑎 = (𝑋𝐿𝑥) → (𝑋 ∈ 𝑎 ↔ 𝑋 ∈ (𝑋𝐿𝑥)))
17		eleq2 2814	. . . . . . . . 9 ⊢ (𝑎 = (𝑋𝐿𝑥) → (𝑌 ∈ 𝑎 ↔ 𝑌 ∈ (𝑋𝐿𝑥)))
18		eleq2 2814	. . . . . . . . 9 ⊢ (𝑎 = (𝑋𝐿𝑥) → (𝑍 ∈ 𝑎 ↔ 𝑍 ∈ (𝑋𝐿𝑥)))
19	16, 17, 18	3anbi123d 1432	. . . . . . . 8 ⊢ (𝑎 = (𝑋𝐿𝑥) → ((𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎) ↔ (𝑋 ∈ (𝑋𝐿𝑥) ∧ 𝑌 ∈ (𝑋𝐿𝑥) ∧ 𝑍 ∈ (𝑋𝐿𝑥))))
20	19	rspcev 3604	. . . . . . 7 ⊢ (((𝑋𝐿𝑥) ∈ ran 𝐿 ∧ (𝑋 ∈ (𝑋𝐿𝑥) ∧ 𝑌 ∈ (𝑋𝐿𝑥) ∧ 𝑍 ∈ (𝑋𝐿𝑥))) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
21	10, 11, 15, 14, 20	syl13anc 1369	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) ∧ 𝑥 ∈ 𝑃) ∧ 𝑋 ≠ 𝑥) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
22		eqid 2724	. . . . . . . 8 ⊢ (dist‘𝐺) = (dist‘𝐺)
23		colline.4	. . . . . . . 8 ⊢ (𝜑 → 2 ≤ (♯‘𝑃))
24	1, 22, 2, 4, 23, 6	tglowdim1i 28245	. . . . . . 7 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 𝑋 ≠ 𝑥)
25	24	ad2antrr 723	. . . . . 6 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) → ∃𝑥 ∈ 𝑃 𝑋 ≠ 𝑥)
26	21, 25	r19.29a 3154	. . . . 5 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 = 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
27	4	ad2antrr 723	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝐺 ∈ TarskiG)
28	6	ad2antrr 723	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑋 ∈ 𝑃)
29		colline.3	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ∈ 𝑃)
30	29	ad2antrr 723	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑍 ∈ 𝑃)
31		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑋 ≠ 𝑍)
32	1, 2, 3, 27, 28, 30, 31	tgelrnln 28374	. . . . . 6 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → (𝑋𝐿𝑍) ∈ ran 𝐿)
33	1, 2, 3, 27, 28, 30, 31	tglinerflx1 28377	. . . . . 6 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑋 ∈ (𝑋𝐿𝑍))
34		simplr 766	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑌 = 𝑍)
35	1, 2, 3, 27, 28, 30, 31	tglinerflx2 28378	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑍 ∈ (𝑋𝐿𝑍))
36	34, 35	eqeltrd 2825	. . . . . 6 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → 𝑌 ∈ (𝑋𝐿𝑍))
37		eleq2 2814	. . . . . . . 8 ⊢ (𝑎 = (𝑋𝐿𝑍) → (𝑋 ∈ 𝑎 ↔ 𝑋 ∈ (𝑋𝐿𝑍)))
38		eleq2 2814	. . . . . . . 8 ⊢ (𝑎 = (𝑋𝐿𝑍) → (𝑌 ∈ 𝑎 ↔ 𝑌 ∈ (𝑋𝐿𝑍)))
39		eleq2 2814	. . . . . . . 8 ⊢ (𝑎 = (𝑋𝐿𝑍) → (𝑍 ∈ 𝑎 ↔ 𝑍 ∈ (𝑋𝐿𝑍)))
40	37, 38, 39	3anbi123d 1432	. . . . . . 7 ⊢ (𝑎 = (𝑋𝐿𝑍) → ((𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎) ↔ (𝑋 ∈ (𝑋𝐿𝑍) ∧ 𝑌 ∈ (𝑋𝐿𝑍) ∧ 𝑍 ∈ (𝑋𝐿𝑍))))
41	40	rspcev 3604	. . . . . 6 ⊢ (((𝑋𝐿𝑍) ∈ ran 𝐿 ∧ (𝑋 ∈ (𝑋𝐿𝑍) ∧ 𝑌 ∈ (𝑋𝐿𝑍) ∧ 𝑍 ∈ (𝑋𝐿𝑍))) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
42	32, 33, 36, 35, 41	syl13anc 1369	. . . . 5 ⊢ (((𝜑 ∧ 𝑌 = 𝑍) ∧ 𝑋 ≠ 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
43	26, 42	pm2.61dane 3021	. . . 4 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
44	43	adantlr 712	. . 3 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 = 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
45		simpll 764	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝜑)
46		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ≠ 𝑍)
47	46	neneqd 2937	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → ¬ 𝑌 = 𝑍)
48		simplr 766	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍))
49		orel2 887	. . . . . 6 ⊢ (¬ 𝑌 = 𝑍 → ((𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍) → 𝑋 ∈ (𝑌𝐿𝑍)))
50	47, 48, 49	sylc 65	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑋 ∈ (𝑌𝐿𝑍))
51	4	ad2antrr 723	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝐺 ∈ TarskiG)
52		colline.2	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
53	52	ad2antrr 723	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ 𝑃)
54	29	ad2antrr 723	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ 𝑃)
55		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ≠ 𝑍)
56	1, 2, 3, 51, 53, 54, 55	tgelrnln 28374	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → (𝑌𝐿𝑍) ∈ ran 𝐿)
57	45, 50, 46, 56	syl21anc 835	. . . 4 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → (𝑌𝐿𝑍) ∈ ran 𝐿)
58	1, 2, 3, 51, 53, 54, 55	tglinerflx1 28377	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ (𝑌𝐿𝑍))
59	45, 50, 46, 58	syl21anc 835	. . . 4 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ (𝑌𝐿𝑍))
60	1, 2, 3, 51, 53, 54, 55	tglinerflx2 28378	. . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ (𝑌𝐿𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ (𝑌𝐿𝑍))
61	45, 50, 46, 60	syl21anc 835	. . . 4 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ (𝑌𝐿𝑍))
62		eleq2 2814	. . . . . 6 ⊢ (𝑎 = (𝑌𝐿𝑍) → (𝑋 ∈ 𝑎 ↔ 𝑋 ∈ (𝑌𝐿𝑍)))
63		eleq2 2814	. . . . . 6 ⊢ (𝑎 = (𝑌𝐿𝑍) → (𝑌 ∈ 𝑎 ↔ 𝑌 ∈ (𝑌𝐿𝑍)))
64		eleq2 2814	. . . . . 6 ⊢ (𝑎 = (𝑌𝐿𝑍) → (𝑍 ∈ 𝑎 ↔ 𝑍 ∈ (𝑌𝐿𝑍)))
65	62, 63, 64	3anbi123d 1432	. . . . 5 ⊢ (𝑎 = (𝑌𝐿𝑍) → ((𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎) ↔ (𝑋 ∈ (𝑌𝐿𝑍) ∧ 𝑌 ∈ (𝑌𝐿𝑍) ∧ 𝑍 ∈ (𝑌𝐿𝑍))))
66	65	rspcev 3604	. . . 4 ⊢ (((𝑌𝐿𝑍) ∈ ran 𝐿 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∧ 𝑌 ∈ (𝑌𝐿𝑍) ∧ 𝑍 ∈ (𝑌𝐿𝑍))) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
67	57, 50, 59, 61, 66	syl13anc 1369	. . 3 ⊢ (((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) ∧ 𝑌 ≠ 𝑍) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
68	44, 67	pm2.61dane 3021	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍)) → ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎))
69		df-ne 2933	. . . . . 6 ⊢ (𝑌 ≠ 𝑍 ↔ ¬ 𝑌 = 𝑍)
70		simplr1 1212	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑋 ∈ 𝑎)
71	4	ad3antrrr 727	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝐺 ∈ TarskiG)
72	52	ad3antrrr 727	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ 𝑃)
73	29	ad3antrrr 727	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ 𝑃)
74		simpr 484	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ≠ 𝑍)
75		simpllr 773	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑎 ∈ ran 𝐿)
76		simplr2 1213	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑌 ∈ 𝑎)
77		simplr3 1214	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑍 ∈ 𝑎)
78	1, 2, 3, 71, 72, 73, 74, 74, 75, 76, 77	tglinethru 28380	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑎 = (𝑌𝐿𝑍))
79	70, 78	eleqtrd 2827	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) ∧ 𝑌 ≠ 𝑍) → 𝑋 ∈ (𝑌𝐿𝑍))
80	79	ex 412	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (𝑌 ≠ 𝑍 → 𝑋 ∈ (𝑌𝐿𝑍)))
81	69, 80	biimtrrid 242	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (¬ 𝑌 = 𝑍 → 𝑋 ∈ (𝑌𝐿𝑍)))
82	81	orrd 860	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (𝑌 = 𝑍 ∨ 𝑋 ∈ (𝑌𝐿𝑍)))
83	82	orcomd 868	. . 3 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ (𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍))
84	83	r19.29an 3150	. 2 ⊢ ((𝜑 ∧ ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)) → (𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍))
85	68, 84	impbida 798	1 ⊢ (𝜑 → ((𝑋 ∈ (𝑌𝐿𝑍) ∨ 𝑌 = 𝑍) ↔ ∃𝑎 ∈ ran 𝐿(𝑋 ∈ 𝑎 ∧ 𝑌 ∈ 𝑎 ∧ 𝑍 ∈ 𝑎)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 844 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2932 ∃wrex 3062 class class class wbr 5139 ran crn 5668 ‘cfv 6534 (class class class)co 7402 ≤ cle 11248 2c2 12266 ♯chash 14291 Basecbs 17149 distcds 17211 TarskiGcstrkg 28171 Itvcitv 28177 LineGclng 28178

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5276 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-pss 3960 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-tp 4626 df-op 4628 df-uni 4901 df-int 4942 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-tr 5257 df-id 5565 df-eprel 5571 df-po 5579 df-so 5580 df-fr 5622 df-we 5624 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-pred 6291 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7358 df-ov 7405 df-oprab 7406 df-mpo 7407 df-om 7850 df-1st 7969 df-2nd 7970 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-oadd 8466 df-er 8700 df-pm 8820 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-dju 9893 df-card 9931 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-nn 12212 df-2 12274 df-3 12275 df-n0 12472 df-xnn0 12544 df-z 12558 df-uz 12822 df-fz 13486 df-fzo 13629 df-hash 14292 df-word 14467 df-concat 14523 df-s1 14548 df-s2 14801 df-s3 14802 df-trkgc 28192 df-trkgb 28193 df-trkgcb 28194 df-trkg 28197 df-cgrg 28255

This theorem is referenced by: (None)

W3C validator