| 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 736 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐺 ∈ TarskiG) |
| 6 | tglnne.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 7 | 6 | ad3antrrr 736 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ∈ 𝐵) |
| 8 | tglnne.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 9 | 8 | ad3antrrr 736 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑌 ∈ 𝐵) |
| 10 | simpllr 781 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ 𝐵) | |
| 11 | simplr 774 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑦 ∈ 𝐵) | |
| 12 | simprr 778 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ≠ 𝑦) | |
| 13 | eqid 2739 | . . . . . 6 ⊢ (dist‘𝐺) = (dist‘𝐺) | |
| 14 | 1, 13, 3, 5, 10, 11 | tgbtwntriv1 28578 | . . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐼𝑦)) |
| 15 | 1, 3, 2, 5, 10, 11, 10, 12, 14 | btwnlng1 28706 | . . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦)) |
| 16 | simprl 776 | . . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → (𝑋𝐿𝑌) = (𝑥𝐿𝑦)) | |
| 17 | 15, 16 | eleqtrrd 2842 | . . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑋𝐿𝑌)) |
| 18 | 1, 2, 3, 5, 7, 9, 17 | tglngne 28637 | . 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ≠ 𝑌) |
| 19 | tglnne.1 | . . 3 ⊢ (𝜑 → (𝑋𝐿𝑌) ∈ ran 𝐿) | |
| 20 | 1, 3, 2, 4, 19 | tgisline 28714 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) |
| 21 | 18, 20 | r19.29vva 3199 | 1 ⊢ (𝜑 → 𝑋 ≠ 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ≠ wne 2934 ran crn 5620 ‘cfv 6486 (class class class)co 7357 Basecbs 17171 distcds 17221 TarskiGcstrkg 28514 Itvcitv 28520 LineGclng 28521 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5219 ax-nul 5229 ax-pr 5363 ax-un 7679 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4263 df-if 4456 df-pw 4532 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-iun 4924 df-br 5074 df-opab 5136 df-mpt 5155 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-fv 6494 df-ov 7360 df-oprab 7361 df-mpo 7362 df-1st 7932 df-2nd 7933 df-trkgc 28535 df-trkgb 28536 df-trkgcb 28537 df-trkg 28540 |
| This theorem is referenced by: footne 28810 footeq 28811 hlperpnel 28812 colperp 28816 mideulem2 28821 opphllem 28822 midex 28824 opphllem3 28836 opphllem6 28839 opphl 28841 lmieu 28871 lnperpex 28890 trgcopy 28891 |
| Copyright terms: Public domain | W3C validator |