Theorem linedegen 36125

Description: When Line is applied with the same argument, the result is the empty set. (Contributed by Scott Fenton, 29-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)

Assertion

Ref	Expression
linedegen	⊢ (𝐴Line𝐴) = ∅

Proof of Theorem linedegen

Dummy variables 𝑙 𝑛 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ov 7434	. 2 ⊢ (𝐴Line𝐴) = (Line‘⟨𝐴, 𝐴⟩)
2		neirr 2947	. . . . . . . . . . 11 ⊢ ¬ 𝐴 ≠ 𝐴
3		simp3 1137	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) → 𝐴 ≠ 𝐴)
4	2, 3	mto 197	. . . . . . . . . 10 ⊢ ¬ (𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴)
5	4	intnanr 487	. . . . . . . . 9 ⊢ ¬ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )
6	5	a1i 11	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ¬ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear ))
7	6	nrex 3072	. . . . . . 7 ⊢ ¬ ∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )
8	7	nex 1797	. . . . . 6 ⊢ ¬ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )
9		eleq1 2827	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ (𝔼‘𝑛) ↔ 𝐴 ∈ (𝔼‘𝑛)))
10		neeq1 3001	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → (𝑥 ≠ 𝑦 ↔ 𝐴 ≠ 𝑦))
11	9, 10	3anbi13d 1437	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ↔ (𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦)))
12		opeq1 4878	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝑦⟩)
13	12	eceq1d 8784	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐴 → [⟨𝑥, 𝑦⟩]◡ Colinear = [⟨𝐴, 𝑦⟩]◡ Colinear )
14	13	eqeq2d 2746	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → (𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear ↔ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ))
15	11, 14	anbi12d 632	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear ) ↔ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear )))
16	15	rexbidv 3177	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → (∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear ) ↔ ∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear )))
17	16	exbidv 1919	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear ) ↔ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear )))
18		eleq1 2827	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ (𝔼‘𝑛) ↔ 𝐴 ∈ (𝔼‘𝑛)))
19		neeq2 3002	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐴 → (𝐴 ≠ 𝑦 ↔ 𝐴 ≠ 𝐴))
20	18, 19	3anbi23d 1438	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ↔ (𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴)))
21		opeq2 4879	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝐴 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐴⟩)
22	21	eceq1d 8784	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐴 → [⟨𝐴, 𝑦⟩]◡ Colinear = [⟨𝐴, 𝐴⟩]◡ Colinear )
23	22	eqeq2d 2746	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → (𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ↔ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear ))
24	20, 23	anbi12d 632	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ) ↔ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
25	24	rexbidv 3177	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ) ↔ ∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
26	25	exbidv 1919	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ) ↔ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
27	17, 26	opelopabg 5548	. . . . . . 7 ⊢ ((𝐴 ∈ V ∧ 𝐴 ∈ V) → (⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} ↔ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
28	27	anidms 566	. . . . . 6 ⊢ (𝐴 ∈ V → (⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} ↔ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
29	8, 28	mtbiri 327	. . . . 5 ⊢ (𝐴 ∈ V → ¬ ⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )})
30		elopaelxp 5778	. . . . . . 7 ⊢ (⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} → ⟨𝐴, 𝐴⟩ ∈ (V × V))
31		opelxp1 5731	. . . . . . 7 ⊢ (⟨𝐴, 𝐴⟩ ∈ (V × V) → 𝐴 ∈ V)
32	30, 31	syl 17	. . . . . 6 ⊢ (⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} → 𝐴 ∈ V)
33	32	con3i 154	. . . . 5 ⊢ (¬ 𝐴 ∈ V → ¬ ⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )})
34	29, 33	pm2.61i 182	. . . 4 ⊢ ¬ ⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
35		df-line2 36119	. . . . . . 7 ⊢ Line = {⟨⟨𝑥, 𝑦⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
36	35	dmeqi 5918	. . . . . 6 ⊢ dom Line = dom {⟨⟨𝑥, 𝑦⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
37		dmoprab 7535	. . . . . 6 ⊢ dom {⟨⟨𝑥, 𝑦⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
38	36, 37	eqtri 2763	. . . . 5 ⊢ dom Line = {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
39	38	eleq2i 2831	. . . 4 ⊢ (⟨𝐴, 𝐴⟩ ∈ dom Line ↔ ⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )})
40	34, 39	mtbir 323	. . 3 ⊢ ¬ ⟨𝐴, 𝐴⟩ ∈ dom Line
41		ndmfv 6942	. . 3 ⊢ (¬ ⟨𝐴, 𝐴⟩ ∈ dom Line → (Line‘⟨𝐴, 𝐴⟩) = ∅)
42	40, 41	ax-mp 5	. 2 ⊢ (Line‘⟨𝐴, 𝐴⟩) = ∅
43	1, 42	eqtri 2763	1 ⊢ (𝐴Line𝐴) = ∅

Syntax hints:  ¬ wn 3   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1537  ∃wex 1776   ∈ wcel 2106   ≠ wne 2938  ∃wrex 3068  Vcvv 3478  ∅c0 4339  ⟨cop 4637  {copab 5210   × cxp 5687  ^◡ccnv 5688  dom cdm 5689  ‘cfv 6563  (class class class)co 7431  {coprab 7432  [cec 8742  ℕcn 12264  𝔼cee 28918   Colinear ccolin 36019  Linecline2 36116

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-xp 5695  df-cnv 5697  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fv 6571  df-ov 7434  df-oprab 7435  df-ec 8746  df-line2 36119

This theorem is referenced by: (None)