![]() |
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 1130 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝐺 ∈ TarskiG) |
6 | tglineelsb2.1 | . . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ 𝐵) | |
7 | 6 | 3ad2ant1 1130 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ∈ 𝐵) |
8 | tglineelsb2.2 | . . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ 𝐵) | |
9 | 8 | 3ad2ant1 1130 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑄 ∈ 𝐵) |
10 | tglineelsb2.4 | . . . . . . 7 ⊢ (𝜑 → 𝑃 ≠ 𝑄) | |
11 | 10 | 3ad2ant1 1130 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ≠ 𝑄) |
12 | simp2l 1196 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑥 ∈ ran 𝐿) | |
13 | simp3ll 1241 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ∈ 𝑥) | |
14 | simp3lr 1242 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑄 ∈ 𝑥) | |
15 | 1, 2, 3, 5, 7, 9, 11, 11, 12, 13, 14 | tglinethru 26430 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑥 = (𝑃𝐿𝑄)) |
16 | simp2r 1197 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑦 ∈ ran 𝐿) | |
17 | simp3rl 1243 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ∈ 𝑦) | |
18 | simp3rr 1244 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑄 ∈ 𝑦) | |
19 | 1, 2, 3, 5, 7, 9, 11, 11, 16, 17, 18 | tglinethru 26430 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑦 = (𝑃𝐿𝑄)) |
20 | 15, 19 | eqtr4d 2836 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑥 = 𝑦) |
21 | 20 | 3expia 1118 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿)) → (((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦)) → 𝑥 = 𝑦)) |
22 | 21 | ralrimivva 3156 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ ran 𝐿∀𝑦 ∈ ran 𝐿(((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦)) → 𝑥 = 𝑦)) |
23 | eleq2w 2873 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ 𝑦)) | |
24 | eleq2w 2873 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑄 ∈ 𝑥 ↔ 𝑄 ∈ 𝑦)) | |
25 | 23, 24 | anbi12d 633 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ↔ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) |
26 | 25 | rmo4 3669 | . 2 ⊢ (∃*𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ↔ ∀𝑥 ∈ ran 𝐿∀𝑦 ∈ ran 𝐿(((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦)) → 𝑥 = 𝑦)) |
27 | 22, 26 | sylibr 237 | 1 ⊢ (𝜑 → ∃*𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∀wral 3106 ∃*wrmo 3109 ran crn 5520 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 TarskiGcstrkg 26224 Itvcitv 26230 LineGclng 26231 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-pm 8392 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-dju 9314 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-hash 13687 df-word 13858 df-concat 13914 df-s1 13941 df-s2 14201 df-s3 14202 df-trkgc 26242 df-trkgb 26243 df-trkgcb 26244 df-trkg 26247 df-cgrg 26305 |
This theorem is referenced by: tglinethrueu 26433 |
Copyright terms: Public domain | W3C validator |