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

Theorem tglnne0 28708
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 2736 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
2 eqid 2736 . . . . 5 (Itv‘𝐺) = (Itv‘𝐺)
3 tglnne0.l . . . . 5 𝐿 = (LineG‘𝐺)
4 tglnne0.g . . . . . 6 (𝜑𝐺 ∈ TarskiG)
54ad3antrrr 731 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝐺 ∈ TarskiG)
6 simpllr 776 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥 ∈ (Base‘𝐺))
7 simplr 769 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑦 ∈ (Base‘𝐺))
8 simprr 773 . . . . 5 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥𝑦)
91, 2, 3, 5, 6, 7, 8tglinerflx1 28701 . . . 4 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦))
10 simprl 771 . . . 4 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝐴 = (𝑥𝐿𝑦))
119, 10eleqtrrd 2839 . . 3 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝑥𝐴)
1211ne0d 4282 . 2 ((((𝜑𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)) → 𝐴 ≠ ∅)
13 tglnne0.1 . . 3 (𝜑𝐴 ∈ ran 𝐿)
141, 2, 3, 4, 13tgisline 28695 . 2 (𝜑 → ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
1512, 14r19.29vva 3197 1 (𝜑𝐴 ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wne 2932  c0 4273  ran crn 5632  cfv 6498  (class class class)co 7367  Basecbs 17179  TarskiGcstrkg 28495  Itvcitv 28501  LineGclng 28502
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-iota 6454  df-fun 6500  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-trkgc 28516  df-trkgb 28517  df-trkgcb 28518  df-trkg 28521
This theorem is referenced by:  hpgerlem  28833
  Copyright terms: Public domain W3C validator