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

Theorem tglnne0 28574
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 2730 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
2 eqid 2730 . . . . 5 (Itv‘𝐺) = (Itv‘𝐺)
3 tglnne0.l . . . . 5 𝐿 = (LineG‘𝐺)
4 tglnne0.g . . . . . 6 (𝜑𝐺 ∈ TarskiG)
54ad3antrrr 730 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝐺 ∈ TarskiG)
6 simpllr 775 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥 ∈ (Base‘𝐺))
7 simplr 768 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑦 ∈ (Base‘𝐺))
8 simprr 772 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥𝑦)
91, 2, 3, 5, 6, 7, 8tglinerflx1 28567 . . . 4 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦))
10 simprl 770 . . . 4 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝐴 = (𝑥𝐿𝑦))
119, 10eleqtrrd 2832 . . 3 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥𝐴)
1211ne0d 4308 . 2 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝐴 ≠ ∅)
13 tglnne0.1 . . 3 (𝜑𝐴 ∈ ran 𝐿)
141, 2, 3, 4, 13tgisline 28561 . 2 (𝜑 → ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
1512, 14r19.29vva 3198 1 (𝜑𝐴 ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  wne 2926  c0 4299  ran crn 5642  cfv 6514  (class class class)co 7390  Basecbs 17186  TarskiGcstrkg 28361  Itvcitv 28367  LineGclng 28368
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-iota 6467  df-fun 6516  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-trkgc 28382  df-trkgb 28383  df-trkgcb 28384  df-trkg 28387
This theorem is referenced by:  hpgerlem  28699
  Copyright terms: Public domain W3C validator