Theorem funline 36370

Description: Show that the Line relationship is a function. (Contributed by Scott Fenton, 25-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)

Assertion

Ref	Expression
funline	⊢ Fun Line

Proof of Theorem funline

Dummy variables 𝑎 𝑏 𝑘 𝑙 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		reeanv 3211	. . . . . 6 ⊢ (∃𝑛 ∈ ℕ ∃𝑚 ∈ ℕ (((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) ↔ (∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
2		eqtr3 2761	. . . . . . . . 9 ⊢ ((𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ) → 𝑙 = 𝑘)
3	2	ad2ant2l 752	. . . . . . . 8 ⊢ ((((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘)
4	3	a1i 11	. . . . . . 7 ⊢ ((𝑛 ∈ ℕ ∧ 𝑚 ∈ ℕ) → ((((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘))
5	4	rexlimivv 3181	. . . . . 6 ⊢ (∃𝑛 ∈ ℕ ∃𝑚 ∈ ℕ (((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘)
6	1, 5	sylbir 236	. . . . 5 ⊢ ((∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘)
7	6	gen2 1803	. . . 4 ⊢ ∀𝑙∀𝑘((∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘)
8		eqeq1 2743	. . . . . . . 8 ⊢ (𝑙 = 𝑘 → (𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ↔ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ))
9	8	anbi2d 636	. . . . . . 7 ⊢ (𝑙 = 𝑘 → (((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
10	9	rexbidv 3163	. . . . . 6 ⊢ (𝑙 = 𝑘 → (∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
11		fveq2 6827	. . . . . . . . . 10 ⊢ (𝑛 = 𝑚 → (𝔼‘𝑛) = (𝔼‘𝑚))
12	11	eleq2d 2825	. . . . . . . . 9 ⊢ (𝑛 = 𝑚 → (𝑎 ∈ (𝔼‘𝑛) ↔ 𝑎 ∈ (𝔼‘𝑚)))
13	11	eleq2d 2825	. . . . . . . . 9 ⊢ (𝑛 = 𝑚 → (𝑏 ∈ (𝔼‘𝑛) ↔ 𝑏 ∈ (𝔼‘𝑚)))
14	12, 13	3anbi12d 1445	. . . . . . . 8 ⊢ (𝑛 = 𝑚 → ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ↔ (𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏)))
15	14	anbi1d 637	. . . . . . 7 ⊢ (𝑛 = 𝑚 → (((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
16	15	cbvrexvw 3218	. . . . . 6 ⊢ (∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ))
17	10, 16	bitrdi 288	. . . . 5 ⊢ (𝑙 = 𝑘 → (∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
18	17	mo4 2570	. . . 4 ⊢ (∃*𝑙∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ∀𝑙∀𝑘((∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘))
19	7, 18	mpbir 232	. . 3 ⊢ ∃*𝑙∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear )
20	19	funoprab 7478	. 2 ⊢ Fun {⟨⟨𝑎, 𝑏⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear )}
21		df-line2 36365	. . 3 ⊢ Line = {⟨⟨𝑎, 𝑏⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear )}
22	21	funeqi 6506	. 2 ⊢ (Fun Line ↔ Fun {⟨⟨𝑎, 𝑏⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear )})
23	20, 22	mpbir 232	1 ⊢ Fun Line

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1092  ∀wal 1545   = wceq 1547   ∈ wcel 2119  ∃*wmo 2541   ≠ wne 2934  ∃wrex 3063  ⟨cop 4561  ^◡ccnv 5617  Fun wfun 6479  ‘cfv 6485  {coprab 7357  [cec 8631  ℕcn 12165  𝔼cee 28974   Colinear ccolin 36265  Linecline2 36362

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-pr 5362

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-iota 6441  df-fun 6487  df-fv 6493  df-oprab 7360  df-line2 36365

This theorem is referenced by:  fvline  36372