Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tglnne | Structured version Visualization version GIF version |
Description: It takes two different points to form a line. (Contributed by Thierry Arnoux, 27-Nov-2019.) |
Ref | Expression |
---|---|
tglineelsb2.p | ⊢ 𝐵 = (Base‘𝐺) |
tglineelsb2.i | ⊢ 𝐼 = (Itv‘𝐺) |
tglineelsb2.l | ⊢ 𝐿 = (LineG‘𝐺) |
tglineelsb2.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
tglnne.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
tglnne.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
tglnne.1 | ⊢ (𝜑 → (𝑋𝐿𝑌) ∈ ran 𝐿) |
Ref | Expression |
---|---|
tglnne | ⊢ (𝜑 → 𝑋 ≠ 𝑌) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tglineelsb2.p | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
2 | tglineelsb2.l | . . 3 ⊢ 𝐿 = (LineG‘𝐺) | |
3 | tglineelsb2.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
4 | tglineelsb2.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
5 | 4 | ad3antrrr 727 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐺 ∈ TarskiG) |
6 | tglnne.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
7 | 6 | ad3antrrr 727 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ∈ 𝐵) |
8 | tglnne.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
9 | 8 | ad3antrrr 727 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑌 ∈ 𝐵) |
10 | simpllr 773 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ 𝐵) | |
11 | simplr 766 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑦 ∈ 𝐵) | |
12 | simprr 770 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ≠ 𝑦) | |
13 | eqid 2738 | . . . . . 6 ⊢ (dist‘𝐺) = (dist‘𝐺) | |
14 | 1, 13, 3, 5, 10, 11 | tgbtwntriv1 26852 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐼𝑦)) |
15 | 1, 3, 2, 5, 10, 11, 10, 12, 14 | btwnlng1 26980 | . . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦)) |
16 | simprl 768 | . . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → (𝑋𝐿𝑌) = (𝑥𝐿𝑦)) | |
17 | 15, 16 | eleqtrrd 2842 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑋𝐿𝑌)) |
18 | 1, 2, 3, 5, 7, 9, 17 | tglngne 26911 | . 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ≠ 𝑌) |
19 | tglnne.1 | . . 3 ⊢ (𝜑 → (𝑋𝐿𝑌) ∈ ran 𝐿) | |
20 | 1, 3, 2, 4, 19 | tgisline 26988 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) |
21 | 18, 20 | r19.29vva 3266 | 1 ⊢ (𝜑 → 𝑋 ≠ 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ran crn 5590 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 distcds 16971 TarskiGcstrkg 26788 Itvcitv 26794 LineGclng 26795 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-1st 7831 df-2nd 7832 df-trkgc 26809 df-trkgb 26810 df-trkgcb 26811 df-trkg 26814 |
This theorem is referenced by: footne 27084 footeq 27085 hlperpnel 27086 colperp 27090 mideulem2 27095 opphllem 27096 midex 27098 opphllem3 27110 opphllem6 27113 opphl 27115 lmieu 27145 lnperpex 27164 trgcopy 27165 |
Copyright terms: Public domain | W3C validator |