| 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 2736 | . . . . 5 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 2 | eqid 2736 | . . . . 5 ⊢ (Itv‘𝐺) = (Itv‘𝐺) | |
| 3 | tglnne0.l | . . . . 5 ⊢ 𝐿 = (LineG‘𝐺) | |
| 4 | tglnne0.g | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | 4 | ad3antrrr 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‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ≠ 𝑦) | |
| 9 | 1, 2, 3, 5, 6, 7, 8 | tglinerflx1 28707 | . . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦)) |
| 10 | simprl 770 | . . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐴 = (𝑥𝐿𝑦)) | |
| 11 | 9, 10 | eleqtrrd 2839 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ 𝐴) |
| 12 | 11 | ne0d 4294 | . 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐴 ≠ ∅) |
| 13 | tglnne0.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) | |
| 14 | 1, 2, 3, 4, 13 | tgisline 28701 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ (Base‘𝐺)∃𝑦 ∈ (Base‘𝐺)(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) |
| 15 | 12, 14 | r19.29vva 3196 | 1 ⊢ (𝜑 → 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ∅c0 4285 ran crn 5625 ‘cfv 6492 (class class class)co 7358 Basecbs 17138 TarskiGcstrkg 28501 Itvcitv 28507 LineGclng 28508 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6448 df-fun 6494 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-trkgc 28522 df-trkgb 28523 df-trkgcb 28524 df-trkg 28527 |
| This theorem is referenced by: hpgerlem 28839 |
| Copyright terms: Public domain | W3C validator |