MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tglnne0 Structured version   Visualization version   GIF version

Theorem tglnne0 28991
Description: A line 𝐴 has at least one point. (Contributed by Thierry Arnoux, 4-Mar-2020.)
Hypotheses
Ref Expression
tglnne0.l 𝐿 = (LineG‘𝐺)
tglnne0.g (𝜑𝐺 ∈ TarskiG)
tglnne0.1 (𝜑𝐴 ∈ ran 𝐿)
Assertion
Ref Expression
tglnne0 (𝜑𝐴 ≠ ∅)

Proof of Theorem tglnne0
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
2 eqid 2760 . . . . 5 (Itv‘𝐺) = (Itv‘𝐺)
3 tglnne0.l . . . . 5 𝐿 = (LineG‘𝐺)
4 tglnne0.g . . . . . 6 (𝜑𝐺 ∈ TarskiG)
54ad3antrrr 743 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝐺 ∈ TarskiG)
6 simpllr 788 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥 ∈ (Base‘𝐺))
7 simplr 781 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑦 ∈ (Base‘𝐺))
8 simprr 785 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥𝑦)
91, 2, 3, 5, 6, 7, 8tglinerflx1 28983 . . . 4 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦))
10 simprl 783 . . . 4 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝐴 = (𝑥𝐿𝑦))
119, 10eleqtrrd 2863 . . 3 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥𝐴)
1211ne0d 4288 . 2 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝐴 ≠ ∅)
13 tglnne0.1 . . 3 (𝜑𝐴 ∈ ran 𝐿)
141, 2, 3, 4, 13tgisline 28977 . 2 (𝜑 → ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
1512, 14r19.29vva 3222 1 (𝜑𝐴 ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wne 2955  c0 4279  ran crn 5656  cfv 6533  (class class class)co 7414  Basecbs 17304  TarskiGcstrkg 28771  Itvcitv 28777  LineGclng 28778
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-trkgc 28792  df-trkgb 28793  df-trkgcb 28794  df-trkg 28797
This theorem is used by:  hpgerlem  29125  prlngmolem2  29313
  Copyright terms: Public domain W3C validator