Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > oppne3 | Structured version Visualization version GIF version |
Description: Points lying on opposite sides of a line cannot be equal. (Contributed by Thierry Arnoux, 3-Aug-2020.) |
Ref | Expression |
---|---|
hpg.p | ⊢ 𝑃 = (Base‘𝐺) |
hpg.d | ⊢ − = (dist‘𝐺) |
hpg.i | ⊢ 𝐼 = (Itv‘𝐺) |
hpg.o | ⊢ 𝑂 = {〈𝑎, 𝑏〉 ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))} |
opphl.l | ⊢ 𝐿 = (LineG‘𝐺) |
opphl.d | ⊢ (𝜑 → 𝐷 ∈ ran 𝐿) |
opphl.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
oppcom.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
oppcom.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
oppcom.o | ⊢ (𝜑 → 𝐴𝑂𝐵) |
Ref | Expression |
---|---|
oppne3 | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hpg.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
2 | hpg.d | . . . 4 ⊢ − = (dist‘𝐺) | |
3 | hpg.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
4 | hpg.o | . . . 4 ⊢ 𝑂 = {〈𝑎, 𝑏〉 ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))} | |
5 | opphl.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
6 | opphl.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ran 𝐿) | |
7 | opphl.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
8 | oppcom.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
9 | oppcom.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
10 | oppcom.o | . . . 4 ⊢ (𝜑 → 𝐴𝑂𝐵) | |
11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | oppne1 26526 | . . 3 ⊢ (𝜑 → ¬ 𝐴 ∈ 𝐷) |
12 | 7 | ad3antrrr 728 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐺 ∈ TarskiG) |
13 | 8 | ad3antrrr 728 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐴 ∈ 𝑃) |
14 | 6 | ad3antrrr 728 | . . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐷 ∈ ran 𝐿) |
15 | simplr 767 | . . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ 𝐷) | |
16 | 1, 5, 3, 12, 14, 15 | tglnpt 26334 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ 𝑃) |
17 | simpr 487 | . . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ (𝐴𝐼𝐵)) | |
18 | simpllr 774 | . . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐴 = 𝐵) | |
19 | 18 | oveq2d 7171 | . . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → (𝐴𝐼𝐴) = (𝐴𝐼𝐵)) |
20 | 17, 19 | eleqtrrd 2916 | . . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ (𝐴𝐼𝐴)) |
21 | 1, 2, 3, 12, 13, 16, 20 | axtgbtwnid 26251 | . . . . 5 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐴 = 𝑡) |
22 | 21, 15 | eqeltrd 2913 | . . . 4 ⊢ ((((𝜑 ∧ 𝐴 = 𝐵) ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐴 ∈ 𝐷) |
23 | 1, 2, 3, 4, 8, 9 | islnopp 26524 | . . . . . . 7 ⊢ (𝜑 → (𝐴𝑂𝐵 ↔ ((¬ 𝐴 ∈ 𝐷 ∧ ¬ 𝐵 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵)))) |
24 | 10, 23 | mpbid 234 | . . . . . 6 ⊢ (𝜑 → ((¬ 𝐴 ∈ 𝐷 ∧ ¬ 𝐵 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵))) |
25 | 24 | simprd 498 | . . . . 5 ⊢ (𝜑 → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵)) |
26 | 25 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵)) |
27 | 22, 26 | r19.29a 3289 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ 𝐷) |
28 | 11, 27 | mtand 814 | . 2 ⊢ (𝜑 → ¬ 𝐴 = 𝐵) |
29 | 28 | neqned 3023 | 1 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ∃wrex 3139 ∖ cdif 3932 class class class wbr 5065 {copab 5127 ran crn 5555 ‘cfv 6354 (class class class)co 7155 Basecbs 16482 distcds 16573 TarskiGcstrkg 26215 Itvcitv 26221 LineGclng 26222 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pr 5329 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-cnv 5562 df-dm 5564 df-rn 5565 df-iota 6313 df-fv 6362 df-ov 7158 df-oprab 7159 df-mpo 7160 df-trkgb 26234 df-trkg 26238 |
This theorem is referenced by: colopp 26554 trgcopyeulem 26590 |
Copyright terms: Public domain | W3C validator |