| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tghilberti1 | Structured version Visualization version GIF version | ||
| Description: There is a line through any two distinct points. Hilbert's axiom I.1 for geometry. (Contributed by Thierry Arnoux, 25-May-2019.) |
| Ref | Expression |
|---|---|
| tglineelsb2.p | ⊢ 𝐵 = (Base‘𝐺) |
| tglineelsb2.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tglineelsb2.l | ⊢ 𝐿 = (LineG‘𝐺) |
| tglineelsb2.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tglineelsb2.1 | ⊢ (𝜑 → 𝑃 ∈ 𝐵) |
| tglineelsb2.2 | ⊢ (𝜑 → 𝑄 ∈ 𝐵) |
| tglineelsb2.4 | ⊢ (𝜑 → 𝑃 ≠ 𝑄) |
| Ref | Expression |
|---|---|
| tghilberti1 | ⊢ (𝜑 → ∃𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tglineelsb2.p | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | tglineelsb2.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
| 3 | tglineelsb2.l | . . 3 ⊢ 𝐿 = (LineG‘𝐺) | |
| 4 | tglineelsb2.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | tglineelsb2.1 | . . 3 ⊢ (𝜑 → 𝑃 ∈ 𝐵) | |
| 6 | tglineelsb2.2 | . . 3 ⊢ (𝜑 → 𝑄 ∈ 𝐵) | |
| 7 | tglineelsb2.4 | . . 3 ⊢ (𝜑 → 𝑃 ≠ 𝑄) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | tgelrnln 29098 | . 2 ⊢ (𝜑 → (𝑃𝐿𝑄) ∈ ran 𝐿) |
| 9 | 1, 2, 3, 4, 5, 6, 7 | tglinerflx1 29101 | . 2 ⊢ (𝜑 → 𝑃 ∈ (𝑃𝐿𝑄)) |
| 10 | 1, 2, 3, 4, 5, 6, 7 | tglinerflx2 29102 | . 2 ⊢ (𝜑 → 𝑄 ∈ (𝑃𝐿𝑄)) |
| 11 | eleq2 2850 | . . . 4 ⊢ (𝑥 = (𝑃𝐿𝑄) → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ (𝑃𝐿𝑄))) | |
| 12 | eleq2 2850 | . . . 4 ⊢ (𝑥 = (𝑃𝐿𝑄) → (𝑄 ∈ 𝑥 ↔ 𝑄 ∈ (𝑃𝐿𝑄))) | |
| 13 | 11, 12 | anbi12d 644 | . . 3 ⊢ (𝑥 = (𝑃𝐿𝑄) → ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ↔ (𝑃 ∈ (𝑃𝐿𝑄) ∧ 𝑄 ∈ (𝑃𝐿𝑄)))) |
| 14 | 13 | rspcev 3577 | . 2 ⊢ (((𝑃𝐿𝑄) ∈ ran 𝐿 ∧ (𝑃 ∈ (𝑃𝐿𝑄) ∧ 𝑄 ∈ (𝑃𝐿𝑄))) → ∃𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥)) |
| 15 | 8, 9, 10, 14 | syl12anc 850 | 1 ⊢ (𝜑 → ∃𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∃wrex 3087 ran crn 5652 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 TarskiGcstrkg 28889 Itvcitv 28895 LineGclng 28896 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-trkgc 28910 df-trkgb 28911 df-trkgcb 28912 df-trkg 28915 |
| This theorem is used by: tglinethrueu 29107 |
| Copyright terms: Public domain | W3C validator |