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

Theorem tglnne0 29124
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 2763 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
2 eqid 2763 . . . . 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 29116 . . . 4 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦))
10 simprl 783 . . . 4 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐴 = (𝑥𝐿𝑦))
119, 10eleqtrrd 2867 . . 3 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ 𝐴)
1211ne0d 4291 . 2 ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐴 ≠ ∅)
13 tglnne0.1 . . 3 (𝜑 → 𝐴 ∈ ran 𝐿)
141, 2, 3, 4, 13tgisline 29110 . 2 (𝜑 → ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦))
1512, 14r19.29vva 3226 1 (𝜑 → 𝐴 ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146   ≠ wne 2959  ∅c0 4281  ran crn 5656  ‘cfv 6547  (class class class)co 7430  Basecbs 17402  TarskiGcstrkg 28904  Itvcitv 28910  LineGclng 28911
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6501  df-fun 6549  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-trkgc 28925  df-trkgb 28926  df-trkgcb 28927  df-trkg 28930
This theorem is used by:  hpgerlem  29258  prlngmolem2  29446
  Copyright terms: Public domain W3C validator