| 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 29110 | . 2 ⊢ (𝜑 → (𝑃𝐿𝑄) ∈ ran 𝐿) |
| 9 | 1, 2, 3, 4, 5, 6, 7 | tglinerflx1 29113 | . 2 ⊢ (𝜑 → 𝑃 ∈ (𝑃𝐿𝑄)) |
| 10 | 1, 2, 3, 4, 5, 6, 7 | tglinerflx2 29114 | . 2 ⊢ (𝜑 → 𝑄 ∈ (𝑃𝐿𝑄)) |
| 11 | eleq2 2852 | . . . 4 ⊢ (𝑥 = (𝑃𝐿𝑄) → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ (𝑃𝐿𝑄))) | |
| 12 | eleq2 2852 | . . . 4 ⊢ (𝑥 = (𝑃𝐿𝑄) → (𝑄 ∈ 𝑥 ↔ 𝑄 ∈ (𝑃𝐿𝑄))) | |
| 13 | 11, 12 | anbi12d 644 | . . 3 ⊢ (𝑥 = (𝑃𝐿𝑄) → ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ↔ (𝑃 ∈ (𝑃𝐿𝑄) ∧ 𝑄 ∈ (𝑃𝐿𝑄)))) |
| 14 | 13 | rspcev 3579 | . 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 1569 ∈ wcel 2146 ≠ wne 2958 ∃wrex 3089 ran crn 5655 ‘cfv 6546 (class class class)co 7427 Basecbs 17399 TarskiGcstrkg 28901 Itvcitv 28907 LineGclng 28908 |
| 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 5251 ax-nul 5262 ax-pr 5394 ax-un 7758 |
| 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 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-fv 6554 df-ov 7430 df-oprab 7431 df-mpo 7432 df-1st 8008 df-2nd 8009 df-trkgc 28922 df-trkgb 28923 df-trkgcb 28924 df-trkg 28927 |
| This theorem is used by: tglinethrueu 29119 |
| Copyright terms: Public domain | W3C validator |