Theorem funline 36634

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 3237	. . . . . 6 ⊢ (∃𝑛 ∈ ℕ ∃𝑚 ∈ ℕ (((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) ↔ (∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
2		eqtr3 2785	. . . . . . . . 9 ⊢ ((𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ) → 𝑙 = 𝑘)
3	2	ad2ant2l 758	. . . . . . . 8 ⊢ ((((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘)
4	3	a1i 11	. . . . . . 7 ⊢ ((𝑛 ∈ ℕ ∧ 𝑚 ∈ ℕ) → ((((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘))
5	4	rexlimivv 3207	. . . . . 6 ⊢ (∃𝑛 ∈ ℕ ∃𝑚 ∈ ℕ (((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘)
6	1, 5	sylbir 238	. . . . 5 ⊢ ((∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘)
7	6	gen2 1826	. . . 4 ⊢ ∀𝑙∀𝑘((∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘)
8		eqeq1 2767	. . . . . . . 8 ⊢ (𝑙 = 𝑘 → (𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ↔ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ))
9	8	anbi2d 641	. . . . . . 7 ⊢ (𝑙 = 𝑘 → (((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
10	9	rexbidv 3189	. . . . . 6 ⊢ (𝑙 = 𝑘 → (∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
11		fveq2 6881	. . . . . . . . . 10 ⊢ (𝑛 = 𝑚 → (𝔼‘𝑛) = (𝔼‘𝑚))
12	11	eleq2d 2849	. . . . . . . . 9 ⊢ (𝑛 = 𝑚 → (𝑎 ∈ (𝔼‘𝑛) ↔ 𝑎 ∈ (𝔼‘𝑚)))
13	11	eleq2d 2849	. . . . . . . . 9 ⊢ (𝑛 = 𝑚 → (𝑏 ∈ (𝔼‘𝑛) ↔ 𝑏 ∈ (𝔼‘𝑚)))
14	12, 13	3anbi12d 1465	. . . . . . . 8 ⊢ (𝑛 = 𝑚 → ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ↔ (𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏)))
15	14	anbi1d 642	. . . . . . 7 ⊢ (𝑛 = 𝑚 → (((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
16	15	cbvrexvw 3244	. . . . . 6 ⊢ (∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear ))
17	10, 16	bitrdi 290	. . . . 5 ⊢ (𝑙 = 𝑘 → (∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )))
18	17	mo4 2594	. . . 4 ⊢ (∃*𝑙∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ↔ ∀𝑙∀𝑘((∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear ) ∧ ∃𝑚 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑚) ∧ 𝑏 ∈ (𝔼‘𝑚) ∧ 𝑎 ≠ 𝑏) ∧ 𝑘 = [⟨𝑎, 𝑏⟩]◡ Colinear )) → 𝑙 = 𝑘))
19	7, 18	mpbir 234	. . 3 ⊢ ∃*𝑙∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear )
20	19	funoprab 7532	. 2 ⊢ Fun {⟨⟨𝑎, 𝑏⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear )}
21		df-line2 36629	. . 3 ⊢ Line = {⟨⟨𝑎, 𝑏⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear )}
22	21	funeqi 6557	. 2 ⊢ (Fun Line ↔ Fun {⟨⟨𝑎, 𝑏⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑎 ∈ (𝔼‘𝑛) ∧ 𝑏 ∈ (𝔼‘𝑛) ∧ 𝑎 ≠ 𝑏) ∧ 𝑙 = [⟨𝑎, 𝑏⟩]◡ Colinear )})
23	20, 22	mpbir 234	1 ⊢ Fun Line

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2143  ∃*wmo 2565   ≠ wne 2958  ∃wrex 3089  ⟨cop 4595  ^◡ccnv 5660  Fun wfun 6530  ‘cfv 6536  {coprab 7411  [cec 8688  ℕcn 12228  𝔼cee 29237   Colinear ccolin 36529  Linecline2 36626

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-sep 5257  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  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-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-iota 6492  df-fun 6538  df-fv 6544  df-oprab 7414  df-line2 36629

This theorem is referenced by:  fvline  36636