| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltgov | Structured version Visualization version GIF version | ||
| Description: Strict "shorter than" geometric relation between segments. (Contributed by Thierry Arnoux, 15-Dec-2019.) |
| Ref | Expression |
|---|---|
| legval.p | ⊢ 𝑃 = (Base‘𝐺) |
| legval.d | ⊢ − = (dist‘𝐺) |
| legval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| legval.l | ⊢ ≤ = (≤G‘𝐺) |
| legval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| legso.a | ⊢ 𝐸 = ( − “ (𝑃 × 𝑃)) |
| legso.f | ⊢ (𝜑 → Fun − ) |
| legso.l | ⊢ < = (( ≤ ↾ 𝐸) ∖ I ) |
| legso.d | ⊢ (𝜑 → (𝑃 × 𝑃) ⊆ dom − ) |
| ltgov.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| ltgov.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| Ref | Expression |
|---|---|
| ltgov | ⊢ (𝜑 → ((𝐴 − 𝐵) < (𝐶 − 𝐷) ↔ ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | legso.l | . . . . 5 ⊢ < = (( ≤ ↾ 𝐸) ∖ I ) | |
| 2 | 1 | breqi 5113 | . . . 4 ⊢ ((𝐴 − 𝐵) < (𝐶 − 𝐷) ↔ (𝐴 − 𝐵)(( ≤ ↾ 𝐸) ∖ I )(𝐶 − 𝐷)) |
| 3 | brdif 5163 | . . . 4 ⊢ ((𝐴 − 𝐵)(( ≤ ↾ 𝐸) ∖ I )(𝐶 − 𝐷) ↔ ((𝐴 − 𝐵)( ≤ ↾ 𝐸)(𝐶 − 𝐷) ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷))) | |
| 4 | 2, 3 | bitri 278 | . . 3 ⊢ ((𝐴 − 𝐵) < (𝐶 − 𝐷) ↔ ((𝐴 − 𝐵)( ≤ ↾ 𝐸)(𝐶 − 𝐷) ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷))) |
| 5 | ovex 7483 | . . . . 5 ⊢ (𝐶 − 𝐷) ∈ V | |
| 6 | 5 | brresi 5994 | . . . 4 ⊢ ((𝐴 − 𝐵)( ≤ ↾ 𝐸)(𝐶 − 𝐷) ↔ ((𝐴 − 𝐵) ∈ 𝐸 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷))) |
| 7 | 6 | anbi1i 636 | . . 3 ⊢ (((𝐴 − 𝐵)( ≤ ↾ 𝐸)(𝐶 − 𝐷) ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷)) ↔ (((𝐴 − 𝐵) ∈ 𝐸 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷))) |
| 8 | an21 657 | . . 3 ⊢ ((((𝐴 − 𝐵) ∈ 𝐸 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷)) ↔ ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ ((𝐴 − 𝐵) ∈ 𝐸 ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷)))) | |
| 9 | 4, 7, 8 | 3bitri 300 | . 2 ⊢ ((𝐴 − 𝐵) < (𝐶 − 𝐷) ↔ ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ ((𝐴 − 𝐵) ∈ 𝐸 ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷)))) |
| 10 | ltgov.a | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 11 | ltgov.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 12 | legso.f | . . . . . . 7 ⊢ (𝜑 → Fun − ) | |
| 13 | legso.d | . . . . . . 7 ⊢ (𝜑 → (𝑃 × 𝑃) ⊆ dom − ) | |
| 14 | 10, 11, 12, 13 | elovimad 7500 | . . . . . 6 ⊢ (𝜑 → (𝐴 − 𝐵) ∈ ( − “ (𝑃 × 𝑃))) |
| 15 | legso.a | . . . . . 6 ⊢ 𝐸 = ( − “ (𝑃 × 𝑃)) | |
| 16 | 14, 15 | eleqtrrdi 2878 | . . . . 5 ⊢ (𝜑 → (𝐴 − 𝐵) ∈ 𝐸) |
| 17 | 16 | biantrurd 542 | . . . 4 ⊢ (𝜑 → (¬ (𝐴 − 𝐵) I (𝐶 − 𝐷) ↔ ((𝐴 − 𝐵) ∈ 𝐸 ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷)))) |
| 18 | 5 | ideq 5839 | . . . . 5 ⊢ ((𝐴 − 𝐵) I (𝐶 − 𝐷) ↔ (𝐴 − 𝐵) = (𝐶 − 𝐷)) |
| 19 | 18 | necon3bbii 3009 | . . . 4 ⊢ (¬ (𝐴 − 𝐵) I (𝐶 − 𝐷) ↔ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) |
| 20 | 17, 19 | bitr3di 289 | . . 3 ⊢ (𝜑 → (((𝐴 − 𝐵) ∈ 𝐸 ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷)) ↔ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷))) |
| 21 | 20 | anbi2d 642 | . 2 ⊢ (𝜑 → (((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ ((𝐴 − 𝐵) ∈ 𝐸 ∧ ¬ (𝐴 − 𝐵) I (𝐶 − 𝐷))) ↔ ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)))) |
| 22 | 9, 21 | bitrid 286 | 1 ⊢ (𝜑 → ((𝐴 − 𝐵) < (𝐶 − 𝐷) ↔ ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ⊆ wss 3899 ∖ cdif 4047 class class class wbr 5107 I cid 5551 × cxp 5655 dom cdm 5657 ↾ cres 5659 “ cima 5660 Fun wfun 6559 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 distcds 17483 TarskiGcstrkg 28948 Itvcitv 28954 ≤Gcleg 29104 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-ne 2963 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-opab 5173 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-fv 6573 df-ov 7453 |
| This theorem is used by: legov3 29120 legso 29121 |
| Copyright terms: Public domain | W3C validator |