| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > abveq0 | Structured version Visualization version GIF version | ||
| Description: The value of an absolute value is zero iff the argument is zero. (Contributed by Mario Carneiro, 8-Sep-2014.) |
| Ref | Expression |
|---|---|
| abvf.a | ⊢ 𝐴 = (AbsVal‘𝑅) |
| abvf.b | ⊢ 𝐵 = (Base‘𝑅) |
| abveq0.z | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| abveq0 | ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ((𝐹‘𝑋) = 0 ↔ 𝑋 = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | abvf.a | . . . . . 6 ⊢ 𝐴 = (AbsVal‘𝑅) | |
| 2 | 1 | abvrcl 20785 | . . . . 5 ⊢ (𝐹 ∈ 𝐴 → 𝑅 ∈ Ring) |
| 3 | abvf.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 4 | eqid 2739 | . . . . . 6 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 5 | eqid 2739 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | abveq0.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 7 | 1, 3, 4, 5, 6 | isabv 20783 | . . . . 5 ⊢ (𝑅 ∈ Ring → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))) |
| 8 | 2, 7 | syl 17 | . . . 4 ⊢ (𝐹 ∈ 𝐴 → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))) |
| 9 | 8 | ibi 268 | . . 3 ⊢ (𝐹 ∈ 𝐴 → (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))) |
| 10 | simpl 483 | . . . 4 ⊢ ((((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 )) | |
| 11 | 10 | ralimi 3076 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ∀𝑥 ∈ 𝐵 ((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 )) |
| 12 | 9, 11 | simpl2im 508 | . 2 ⊢ (𝐹 ∈ 𝐴 → ∀𝑥 ∈ 𝐵 ((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 )) |
| 13 | fveqeq2 6836 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) = 0 ↔ (𝐹‘𝑋) = 0)) | |
| 14 | eqeq1 2743 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 = 0 ↔ 𝑋 = 0 )) | |
| 15 | 13, 14 | bibi12d 346 | . . 3 ⊢ (𝑥 = 𝑋 → (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ↔ ((𝐹‘𝑋) = 0 ↔ 𝑋 = 0 ))) |
| 16 | 15 | rspccva 3559 | . 2 ⊢ ((∀𝑥 ∈ 𝐵 ((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ 𝑋 ∈ 𝐵) → ((𝐹‘𝑋) = 0 ↔ 𝑋 = 0 )) |
| 17 | 12, 16 | sylan 586 | 1 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ((𝐹‘𝑋) = 0 ↔ 𝑋 = 0 )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3053 class class class wbr 5072 ⟶wf 6481 ‘cfv 6485 (class class class)co 7356 0cc0 11029 + caddc 11032 · cmul 11034 +∞cpnf 11167 ≤ cle 11171 [,)cico 13291 Basecbs 17170 +gcplusg 17211 .rcmulr 17212 0gc0g 17393 Ringcrg 20205 AbsValcabv 20780 |
| 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 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 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-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-fv 6493 df-ov 7359 df-oprab 7360 df-mpo 7361 df-map 8765 df-abv 20781 |
| This theorem is referenced by: abvne0 20791 abv0 20795 abvmet 24558 |
| Copyright terms: Public domain | W3C validator |