| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tglnne0 | Structured version Visualization version GIF version | ||
| Description: A line 𝐴 has at least one point. (Contributed by Thierry Arnoux, 4-Mar-2020.) |
| Ref | Expression |
|---|---|
| tglnne0.l | ⊢ 𝐿 = (LineG‘𝐺) |
| tglnne0.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tglnne0.1 | ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) |
| Ref | Expression |
|---|---|
| tglnne0 | ⊢ (𝜑 → 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2769 | . . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 2 | eqid 2769 | . . . . 5 ⊢ (Itv‘𝐺) = (Itv‘𝐺) | |
| 3 | tglnne0.l | . . . . 5 ⊢ 𝐿 = (LineG‘𝐺) | |
| 4 | tglnne0.g | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | 4 | ad3antrrr 742 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐺 ∈ TarskiG) |
| 6 | simpllr 787 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (Base‘𝐺)) | |
| 7 | simplr 780 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑦 ∈ (Base‘𝐺)) | |
| 8 | simprr 784 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ≠ 𝑦) | |
| 9 | 1, 2, 3, 5, 6, 7, 8 | tglinerflx1 28868 | . . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦)) |
| 10 | simprl 782 | . . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐴 = (𝑥𝐿𝑦)) | |
| 11 | 9, 10 | eleqtrrd 2872 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ 𝐴) |
| 12 | 11 | ne0d 4303 | . 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐴 ≠ ∅) |
| 13 | tglnne0.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) | |
| 14 | 1, 2, 3, 4, 13 | tgisline 28862 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) |
| 15 | 12, 14 | r19.29vva 3231 | 1 ⊢ (𝜑 → 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∅c0 4294 ran crn 5663 ‘cfv 6537 (class class class)co 7411 Basecbs 17269 TarskiGcstrkg 28662 Itvcitv 28668 LineGclng 28669 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-trkgc 28683 df-trkgb 28684 df-trkgcb 28685 df-trkg 28688 |
| This theorem is referenced by: hpgerlem 29006 prlngmolem2 29156 |
| Copyright terms: Public domain | W3C validator |