| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tghilberti2 | Structured version Visualization version GIF version | ||
| Description: There is at most one line through any two distinct points. Hilbert's axiom I.2 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 |
|---|---|
| tghilberti2 | ⊢ (𝜑 → ∃*𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tglineelsb2.p | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | tglineelsb2.i | . . . . . 6 ⊢ 𝐼 = (Itv‘𝐺) | |
| 3 | tglineelsb2.l | . . . . . 6 ⊢ 𝐿 = (LineG‘𝐺) | |
| 4 | tglineelsb2.g | . . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | 4 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝐺 ∈ TarskiG) |
| 6 | tglineelsb2.1 | . . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ 𝐵) | |
| 7 | 6 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ∈ 𝐵) |
| 8 | tglineelsb2.2 | . . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ 𝐵) | |
| 9 | 8 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑄 ∈ 𝐵) |
| 10 | tglineelsb2.4 | . . . . . . 7 ⊢ (𝜑 → 𝑃 ≠ 𝑄) | |
| 11 | 10 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ≠ 𝑄) |
| 12 | simp2l 1218 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑥 ∈ ran 𝐿) | |
| 13 | simp3ll 1263 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ∈ 𝑥) | |
| 14 | simp3lr 1264 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑄 ∈ 𝑥) | |
| 15 | 1, 2, 3, 5, 7, 9, 11, 11, 12, 13, 14 | tglinethru 29086 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑥 = (𝑃𝐿𝑄)) |
| 16 | simp2r 1219 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑦 ∈ ran 𝐿) | |
| 17 | simp3rl 1265 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ∈ 𝑦) | |
| 18 | simp3rr 1266 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑄 ∈ 𝑦) | |
| 19 | 1, 2, 3, 5, 7, 9, 11, 11, 16, 17, 18 | tglinethru 29086 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑦 = (𝑃𝐿𝑄)) |
| 20 | 15, 19 | eqtr4d 2799 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑥 = 𝑦) |
| 21 | 20 | 3expia 1139 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿)) → (((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦)) → 𝑥 = 𝑦)) |
| 22 | 21 | ralrimivva 3206 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ ran 𝐿∀𝑦 ∈ ran 𝐿(((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦)) → 𝑥 = 𝑦)) |
| 23 | eleq2w 2845 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ 𝑦)) | |
| 24 | eleq2w 2845 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑄 ∈ 𝑥 ↔ 𝑄 ∈ 𝑦)) | |
| 25 | 23, 24 | anbi12d 644 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ↔ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) |
| 26 | 25 | rmo4 3688 | . 2 ⊢ (∃*𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ↔ ∀𝑥 ∈ ran 𝐿∀𝑦 ∈ ran 𝐿(((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦)) → 𝑥 = 𝑦)) |
| 27 | 22, 26 | sylibr 237 | 1 ⊢ (𝜑 → ∃*𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∀wral 3077 ∃*wrmo 3365 ran crn 5652 ‘cfv 6531 (class class class)co 7412 Basecbs 17367 TarskiGcstrkg 28871 Itvcitv 28877 LineGclng 28878 |
| 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-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| 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-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 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-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 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-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-oadd 8464 df-er 8701 df-pm 8834 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-dju 9963 df-card 10001 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-xnn0 12661 df-z 12675 df-uz 12947 df-fz 13621 df-fzo 13769 df-hash 14455 df-word 14639 df-concat 14696 df-s1 14723 df-s2 14979 df-s3 14980 df-trkgc 28892 df-trkgb 28893 df-trkgcb 28894 df-trkg 28897 df-cgrg 28956 |
| This theorem is used by: tglinethrueu 29089 |
| Copyright terms: Public domain | W3C validator |