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 1082 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝐺 ∈ TarskiG) |
6 | tglineelsb2.1 | . . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ 𝐵) | |
7 | 6 | 3ad2ant1 1082 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ∈ 𝐵) |
8 | tglineelsb2.2 | . . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ 𝐵) | |
9 | 8 | 3ad2ant1 1082 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑄 ∈ 𝐵) |
10 | tglineelsb2.4 | . . . . . . 7 ⊢ (𝜑 → 𝑃 ≠ 𝑄) | |
11 | 10 | 3ad2ant1 1082 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ≠ 𝑄) |
12 | simp2l 1087 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑥 ∈ ran 𝐿) | |
13 | simp3ll 1132 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ∈ 𝑥) | |
14 | simp3lr 1133 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑄 ∈ 𝑥) | |
15 | 1, 2, 3, 5, 7, 9, 11, 11, 12, 13, 14 | tglinethru 25531 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑥 = (𝑃𝐿𝑄)) |
16 | simp2r 1088 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑦 ∈ ran 𝐿) | |
17 | simp3rl 1134 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑃 ∈ 𝑦) | |
18 | simp3rr 1135 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑄 ∈ 𝑦) | |
19 | 1, 2, 3, 5, 7, 9, 11, 11, 16, 17, 18 | tglinethru 25531 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑦 = (𝑃𝐿𝑄)) |
20 | 15, 19 | eqtr4d 2659 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿) ∧ ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) → 𝑥 = 𝑦) |
21 | 20 | 3expia 1267 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ran 𝐿 ∧ 𝑦 ∈ ran 𝐿)) → (((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦)) → 𝑥 = 𝑦)) |
22 | 21 | ralrimivva 2971 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ ran 𝐿∀𝑦 ∈ ran 𝐿(((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦)) → 𝑥 = 𝑦)) |
23 | eleq2 2690 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ 𝑦)) | |
24 | eleq2 2690 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑄 ∈ 𝑥 ↔ 𝑄 ∈ 𝑦)) | |
25 | 23, 24 | anbi12d 747 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ↔ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦))) |
26 | 25 | rmo4 3399 | . 2 ⊢ (∃*𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ↔ ∀𝑥 ∈ ran 𝐿∀𝑦 ∈ ran 𝐿(((𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥) ∧ (𝑃 ∈ 𝑦 ∧ 𝑄 ∈ 𝑦)) → 𝑥 = 𝑦)) |
27 | 22, 26 | sylibr 224 | 1 ⊢ (𝜑 → ∃*𝑥 ∈ ran 𝐿(𝑃 ∈ 𝑥 ∧ 𝑄 ∈ 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ∃*wrmo 2915 ran crn 5115 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 TarskiGcstrkg 25329 Itvcitv 25335 LineGclng 25336 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-xnn0 11364 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-hash 13118 df-word 13299 df-concat 13301 df-s1 13302 df-s2 13593 df-s3 13594 df-trkgc 25347 df-trkgb 25348 df-trkgcb 25349 df-trkg 25352 df-cgrg 25406 |
This theorem is referenced by: tglinethrueu 25534 |
Copyright terms: Public domain | W3C validator |