ellines - Mathbox for Scott Fenton

	Mathbox for Scott Fenton		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ellines		Structured version Visualization version GIF version

Theorem ellines 36625

Description: Membership in the set of all lines. (Contributed by Scott Fenton, 28-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)

**Assertion**
Ref	Expression
ellines	⊢ (𝐴 ∈ LinesEE ↔ ∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞)))

Distinct variable group: 𝐴,𝑛,𝑝,𝑞

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

Step	Hyp	Ref	Expression
1		elex 3476	. 2 ⊢ (𝐴 ∈ LinesEE → 𝐴 ∈ V)
2		ovex 7445	. . . . . . 7 ⊢ (𝑝Line𝑞) ∈ V
3		eleq1 2851	. . . . . . 7 ⊢ (𝐴 = (𝑝Line𝑞) → (𝐴 ∈ V ↔ (𝑝Line𝑞) ∈ V))
4	2, 3	mpbiri 261	. . . . . 6 ⊢ (𝐴 = (𝑝Line𝑞) → 𝐴 ∈ V)
5	4	adantl 486	. . . . 5 ⊢ ((𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞)) → 𝐴 ∈ V)
6	5	rexlimivw 3162	. . . 4 ⊢ (∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞)) → 𝐴 ∈ V)
7	6	a1i 11	. . 3 ⊢ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) → (∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞)) → 𝐴 ∈ V))
8	7	rexlimivv 3207	. 2 ⊢ (∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞)) → 𝐴 ∈ V)
9		eleq1 2851	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ LinesEE ↔ 𝐴 ∈ LinesEE))
10		eqeq1 2767	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 = (𝑝Line𝑞) ↔ 𝐴 = (𝑝Line𝑞)))
11	10	anbi2d 641	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)) ↔ (𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞))))
12	11	rexbidv 3189	. . . 4 ⊢ (𝑥 = 𝐴 → (∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)) ↔ ∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞))))
13	12	2rexbidv 3230	. . 3 ⊢ (𝑥 = 𝐴 → (∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)) ↔ ∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞))))
14		df-lines2 36612	. . . . . 6 ⊢ LinesEE = ran Line
15		df-line2 36610	. . . . . . 7 ⊢ Line = {⟨⟨𝑝, 𝑞⟩, 𝑥⟩ ∣ ∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )}
16	15	rneqi 5929	. . . . . 6 ⊢ ran Line = ran {⟨⟨𝑝, 𝑞⟩, 𝑥⟩ ∣ ∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )}
17		rnoprab 7517	. . . . . 6 ⊢ ran {⟨⟨𝑝, 𝑞⟩, 𝑥⟩ ∣ ∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )} = {𝑥 ∣ ∃𝑝∃𝑞∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )}
18	14, 16, 17	3eqtri 2790	. . . . 5 ⊢ LinesEE = {𝑥 ∣ ∃𝑝∃𝑞∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )}
19	18	eleq2i 2855	. . . 4 ⊢ (𝑥 ∈ LinesEE ↔ 𝑥 ∈ {𝑥 ∣ ∃𝑝∃𝑞∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )})
20		abid 2745	. . . . 5 ⊢ (𝑥 ∈ {𝑥 ∣ ∃𝑝∃𝑞∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )} ↔ ∃𝑝∃𝑞∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear ))
21		df-rex 3090	. . . . . . 7 ⊢ (∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear ) ↔ ∃𝑛(𝑛 ∈ ℕ ∧ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )))
22	21	2exbii 1879	. . . . . 6 ⊢ (∃𝑝∃𝑞∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear ) ↔ ∃𝑝∃𝑞∃𝑛(𝑛 ∈ ℕ ∧ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )))
23		exrot3 2200	. . . . . . 7 ⊢ (∃𝑛∃𝑝∃𝑞(𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))) ↔ ∃𝑝∃𝑞∃𝑛(𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))))
24		r2ex 3202	. . . . . . . 8 ⊢ (∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)) ↔ ∃𝑛∃𝑝((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ ∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞))))
25		r19.42v 3197	. . . . . . . . . 10 ⊢ (∃𝑞 ∈ (𝔼‘𝑛)((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞))) ↔ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ ∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞))))
26		df-rex 3090	. . . . . . . . . 10 ⊢ (∃𝑞 ∈ (𝔼‘𝑛)((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞))) ↔ ∃𝑞(𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))))
27	25, 26	bitr3i 280	. . . . . . . . 9 ⊢ (((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ ∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞))) ↔ ∃𝑞(𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))))
28	27	2exbii 1879	. . . . . . . 8 ⊢ (∃𝑛∃𝑝((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ ∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞))) ↔ ∃𝑛∃𝑝∃𝑞(𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))))
29	24, 28	bitri 278	. . . . . . 7 ⊢ (∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)) ↔ ∃𝑛∃𝑝∃𝑞(𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))))
30		anass 473	. . . . . . . . . 10 ⊢ (((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞))) ↔ (𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))))
31		anass 473	. . . . . . . . . . 11 ⊢ ((((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = (𝑝Line𝑞)) ↔ ((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞))))
32		simplrl 788	. . . . . . . . . . . . . 14 ⊢ (((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞) → 𝑛 ∈ ℕ)
33		simplrr 789	. . . . . . . . . . . . . . 15 ⊢ (((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞) → 𝑝 ∈ (𝔼‘𝑛))
34		simpll 778	. . . . . . . . . . . . . . 15 ⊢ (((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞) → 𝑞 ∈ (𝔼‘𝑛))
35		simpr 489	. . . . . . . . . . . . . . 15 ⊢ (((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞) → 𝑝 ≠ 𝑞)
36	33, 34, 35	3jca 1146	. . . . . . . . . . . . . 14 ⊢ (((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞) → (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞))
37	32, 36	jca 520	. . . . . . . . . . . . 13 ⊢ (((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞) → (𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)))
38		simpr2 1214	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) → 𝑞 ∈ (𝔼‘𝑛))
39		simpl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) → 𝑛 ∈ ℕ)
40		simpr1 1213	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) → 𝑝 ∈ (𝔼‘𝑛))
41	38, 39, 40	jca32 524	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) → (𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))))
42		simpr3 1215	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) → 𝑝 ≠ 𝑞)
43	41, 42	jca 520	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) → ((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞))
44	37, 43	impbii 212	. . . . . . . . . . . 12 ⊢ (((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞) ↔ (𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)))
45	44	anbi1i 635	. . . . . . . . . . 11 ⊢ ((((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = (𝑝Line𝑞)) ↔ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) ∧ 𝑥 = (𝑝Line𝑞)))
46	31, 45	bitr3i 280	. . . . . . . . . 10 ⊢ (((𝑞 ∈ (𝔼‘𝑛) ∧ (𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞))) ↔ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) ∧ 𝑥 = (𝑝Line𝑞)))
47	30, 46	bitr3i 280	. . . . . . . . 9 ⊢ ((𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))) ↔ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) ∧ 𝑥 = (𝑝Line𝑞)))
48		fvline 36617	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) → (𝑝Line𝑞) = {𝑥 ∣ 𝑥 Colinear ⟨𝑝, 𝑞⟩})
49		opex 5447	. . . . . . . . . . . . . 14 ⊢ ⟨𝑝, 𝑞⟩ ∈ V
50		dfec2 8698	. . . . . . . . . . . . . 14 ⊢ (⟨𝑝, 𝑞⟩ ∈ V → [⟨𝑝, 𝑞⟩]^◡ Colinear = {𝑥 ∣ ⟨𝑝, 𝑞⟩^◡ Colinear 𝑥})
51	49, 50	ax-mp 5	. . . . . . . . . . . . 13 ⊢ [⟨𝑝, 𝑞⟩]^◡ Colinear = {𝑥 ∣ ⟨𝑝, 𝑞⟩^◡ Colinear 𝑥}
52		vex 3459	. . . . . . . . . . . . . . 15 ⊢ 𝑥 ∈ V
53	49, 52	brcnv 5870	. . . . . . . . . . . . . 14 ⊢ (⟨𝑝, 𝑞⟩^◡ Colinear 𝑥 ↔ 𝑥 Colinear ⟨𝑝, 𝑞⟩)
54	53	abbii 2830	. . . . . . . . . . . . 13 ⊢ {𝑥 ∣ ⟨𝑝, 𝑞⟩^◡ Colinear 𝑥} = {𝑥 ∣ 𝑥 Colinear ⟨𝑝, 𝑞⟩}
55	51, 54	eqtri 2786	. . . . . . . . . . . 12 ⊢ [⟨𝑝, 𝑞⟩]^◡ Colinear = {𝑥 ∣ 𝑥 Colinear ⟨𝑝, 𝑞⟩}
56	48, 55	eqtr4di 2816	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) → (𝑝Line𝑞) = [⟨𝑝, 𝑞⟩]^◡ Colinear )
57	56	eqeq2d 2774	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) → (𝑥 = (𝑝Line𝑞) ↔ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear ))
58	57	pm5.32i 584	. . . . . . . . 9 ⊢ (((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) ∧ 𝑥 = (𝑝Line𝑞)) ↔ ((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear ))
59		anass 473	. . . . . . . . 9 ⊢ (((𝑛 ∈ ℕ ∧ (𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞)) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear ) ↔ (𝑛 ∈ ℕ ∧ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )))
60	47, 58, 59	3bitrri 301	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕ ∧ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )) ↔ (𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))))
61	60	3exbii 1880	. . . . . . 7 ⊢ (∃𝑝∃𝑞∃𝑛(𝑛 ∈ ℕ ∧ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )) ↔ ∃𝑝∃𝑞∃𝑛(𝑞 ∈ (𝔼‘𝑛) ∧ ((𝑛 ∈ ℕ ∧ 𝑝 ∈ (𝔼‘𝑛)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))))
62	23, 29, 61	3bitr4ri 307	. . . . . 6 ⊢ (∃𝑝∃𝑞∃𝑛(𝑛 ∈ ℕ ∧ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )) ↔ ∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))
63	22, 62	bitri 278	. . . . 5 ⊢ (∃𝑝∃𝑞∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear ) ↔ ∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))
64	20, 63	bitri 278	. . . 4 ⊢ (𝑥 ∈ {𝑥 ∣ ∃𝑝∃𝑞∃𝑛 ∈ ℕ ((𝑝 ∈ (𝔼‘𝑛) ∧ 𝑞 ∈ (𝔼‘𝑛) ∧ 𝑝 ≠ 𝑞) ∧ 𝑥 = [⟨𝑝, 𝑞⟩]^◡ Colinear )} ↔ ∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))
65	19, 64	bitri 278	. . 3 ⊢ (𝑥 ∈ LinesEE ↔ ∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝑥 = (𝑝Line𝑞)))
66	9, 13, 65	vtoclbg 3525	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ LinesEE ↔ ∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞))))
67	1, 8, 66	pm5.21nii 381	1 ⊢ (𝐴 ∈ LinesEE ↔ ∃𝑛 ∈ ℕ ∃𝑝 ∈ (𝔼‘𝑛)∃𝑞 ∈ (𝔼‘𝑛)(𝑝 ≠ 𝑞 ∧ 𝐴 = (𝑝Line𝑞)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∃wex 1809 ∈ wcel 2143 {cab 2741 ≠ wne 2958 ∃wrex 3089 Vcvv 3455 ⟨cop 4596 class class class wbr 5110 ^◡ccnv 5662 ran crn 5664 ‘cfv 6538 (class class class)co 7412 {coprab 7413 [cec 8693 ℕcn 12234 𝔼cee 29218 Colinear ccolin 36510 Linecline2 36607 LinesEEclines2 36609

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-1cn 11159 ax-addcl 11161

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7415 df-oprab 7416 df-om 7864 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-ec 8697 df-nn 12235 df-colinear 36512 df-line2 36610 df-lines2 36612

This theorem is referenced by: linethru 36626 hilbert1.1 36627

W3C validator