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

Theorem linedegen 37000
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.
StepHypRef Expression
1 df-ov 7423 . 2 (𝐴Line𝐴) = (Line‘⟨𝐴, 𝐴⟩)
2 neirr 2964 . . . . . . . . . . 11 ¬ 𝐴 ≠ 𝐴
3 simp3 1156 . . . . . . . . . . 11 ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) → 𝐴 ≠ 𝐴)
42, 3mto 200 . . . . . . . . . 10 ¬ (𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴)
54intnanr 493 . . . . . . . . 9 ¬ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )
65a1i 11 . . . . . . . 8 (𝑛 ∈ ℕ → ¬ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear ))
76nrex 3090 . . . . . . 7 ¬ ∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )
87nex 1832 . . . . . 6 ¬ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )
9 eleq1 2848 . . . . . . . . . . . 12 (𝑥 = 𝐴 → (𝑥 ∈ (𝔼‘𝑛) ↔ 𝐴 ∈ (𝔼‘𝑛)))
10 neeq1 3017 . . . . . . . . . . . 12 (𝑥 = 𝐴 → (𝑥 ≠ 𝑦 ↔ 𝐴 ≠ 𝑦))
119, 103anbi13d 1466 . . . . . . . . . . 11 (𝑥 = 𝐴 → ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ↔ (𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦)))
12 opeq1 4839 . . . . . . . . . . . . 13 (𝑥 = 𝐴 → ⟨𝑥, 𝑦⟩ = ⟨𝐴, 𝑦⟩)
1312eceq1d 8761 . . . . . . . . . . . 12 (𝑥 = 𝐴 → [⟨𝑥, 𝑦⟩]◡ Colinear = [⟨𝐴, 𝑦⟩]◡ Colinear )
1413eqeq2d 2771 . . . . . . . . . . 11 (𝑥 = 𝐴 → (𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear ↔ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ))
1511, 14anbi12d 644 . . . . . . . . . 10 (𝑥 = 𝐴 → (((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear ) ↔ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear )))
1615rexbidv 3186 . . . . . . . . 9 (𝑥 = 𝐴 → (∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear ) ↔ ∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear )))
1716exbidv 1953 . . . . . . . 8 (𝑥 = 𝐴 → (∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear ) ↔ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear )))
18 eleq1 2848 . . . . . . . . . . . 12 (𝑦 = 𝐴 → (𝑦 ∈ (𝔼‘𝑛) ↔ 𝐴 ∈ (𝔼‘𝑛)))
19 neeq2 3018 . . . . . . . . . . . 12 (𝑦 = 𝐴 → (𝐴 ≠ 𝑦 ↔ 𝐴 ≠ 𝐴))
2018, 193anbi23d 1467 . . . . . . . . . . 11 (𝑦 = 𝐴 → ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ↔ (𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴)))
21 opeq2 4840 . . . . . . . . . . . . 13 (𝑦 = 𝐴 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐴⟩)
2221eceq1d 8761 . . . . . . . . . . . 12 (𝑦 = 𝐴 → [⟨𝐴, 𝑦⟩]◡ Colinear = [⟨𝐴, 𝐴⟩]◡ Colinear )
2322eqeq2d 2771 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ↔ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear ))
2420, 23anbi12d 644 . . . . . . . . . 10 (𝑦 = 𝐴 → (((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ) ↔ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
2524rexbidv 3186 . . . . . . . . 9 (𝑦 = 𝐴 → (∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ) ↔ ∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
2625exbidv 1953 . . . . . . . 8 (𝑦 = 𝐴 → (∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝑦) ∧ 𝑙 = [⟨𝐴, 𝑦⟩]◡ Colinear ) ↔ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
2717, 26opelopabg 5512 . . . . . . 7 ((𝐴 ∈ V ∧ 𝐴 ∈ V) → (⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} ↔ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
2827anidms 577 . . . . . 6 (𝐴 ∈ V → (⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} ↔ ∃𝑙∃𝑛 ∈ ℕ ((𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ∈ (𝔼‘𝑛) ∧ 𝐴 ≠ 𝐴) ∧ 𝑙 = [⟨𝐴, 𝐴⟩]◡ Colinear )))
298, 28mtbiri 330 . . . . 5 (𝐴 ∈ V → ¬ ⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )})
30 elopaelxp 5740 . . . . . . 7 (⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} → ⟨𝐴, 𝐴⟩ ∈ (V × V))
31 opelxp1 5692 . . . . . . 7 (⟨𝐴, 𝐴⟩ ∈ (V × V) → 𝐴 ∈ V)
3230, 31syl 18 . . . . . 6 (⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} → 𝐴 ∈ V)
3332con3i 155 . . . . 5 (¬ 𝐴 ∈ V → ¬ ⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )})
3429, 33pm2.61i 184 . . . 4 ¬ ⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
35 df-line2 36994 . . . . . . 7 Line = {⟨⟨𝑥, 𝑦⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
3635dmeqi 5885 . . . . . 6 dom Line = dom {⟨⟨𝑥, 𝑦⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
37 dmoprab 7523 . . . . . 6 dom {⟨⟨𝑥, 𝑦⟩, 𝑙⟩ ∣ ∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
3836, 37eqtri 2783 . . . . 5 dom Line = {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )}
3938eleq2i 2852 . . . 4 (⟨𝐴, 𝐴⟩ ∈ dom Line ↔ ⟨𝐴, 𝐴⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ∃𝑙∃𝑛 ∈ ℕ ((𝑥 ∈ (𝔼‘𝑛) ∧ 𝑦 ∈ (𝔼‘𝑛) ∧ 𝑥 ≠ 𝑦) ∧ 𝑙 = [⟨𝑥, 𝑦⟩]◡ Colinear )})
4034, 39mtbir 326 . . 3 ¬ ⟨𝐴, 𝐴⟩ ∈ dom Line
41 ndmfv 6917 . . 3 (¬ ⟨𝐴, 𝐴⟩ ∈ dom Line → (Line‘⟨𝐴, 𝐴⟩) = ∅)
4240, 41ax-mp 5 . 2 (Line‘⟨𝐴, 𝐴⟩) = ∅
431, 42eqtri 2783 1 (𝐴Line𝐴) = ∅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086  Vcvv 3450  ∅c0 4278  ⟨cop 4834  {copab 5166   × cxp 5648  ◡ccnv 5649  dom cdm 5650  ‘cfv 6538  (class class class)co 7420  {coprab 7421  [cec 8718  ℕcn 12338  𝔼cee 29470   Colinear ccolin 36894  Linecline2 36991
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5656  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fv 6546  df-ov 7423  df-oprab 7424  df-ec 8722  df-line2 36994
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator