| 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 20744 | . . . . 5 ⊢ (𝐹 ∈ 𝐴 → 𝑅 ∈ Ring) |
| 3 | abvf.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 4 | eqid 2734 | . . . . . 6 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 5 | eqid 2734 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | abveq0.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 7 | 1, 3, 4, 5, 6 | isabv 20742 | . . . . 5 ⊢ (𝑅 ∈ Ring → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))) |
| 8 | 2, 7 | syl 17 | . . . 4 ⊢ (𝐹 ∈ 𝐴 → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))) |
| 9 | 8 | ibi 267 | . . 3 ⊢ (𝐹 ∈ 𝐴 → (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))) |
| 10 | simpl 482 | . . . 4 ⊢ ((((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 )) | |
| 11 | 10 | ralimi 3071 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥(+g‘𝑅)𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ∀𝑥 ∈ 𝐵 ((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 )) |
| 12 | 9, 11 | simpl2im 503 | . 2 ⊢ (𝐹 ∈ 𝐴 → ∀𝑥 ∈ 𝐵 ((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 )) |
| 13 | fveqeq2 6841 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) = 0 ↔ (𝐹‘𝑋) = 0)) | |
| 14 | eqeq1 2738 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 = 0 ↔ 𝑋 = 0 )) | |
| 15 | 13, 14 | bibi12d 345 | . . 3 ⊢ (𝑥 = 𝑋 → (((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ↔ ((𝐹‘𝑋) = 0 ↔ 𝑋 = 0 ))) |
| 16 | 15 | rspccva 3573 | . 2 ⊢ ((∀𝑥 ∈ 𝐵 ((𝐹‘𝑥) = 0 ↔ 𝑥 = 0 ) ∧ 𝑋 ∈ 𝐵) → ((𝐹‘𝑋) = 0 ↔ 𝑋 = 0 )) |
| 17 | 12, 16 | sylan 580 | 1 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ((𝐹‘𝑋) = 0 ↔ 𝑋 = 0 )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3049 class class class wbr 5096 ⟶wf 6486 ‘cfv 6490 (class class class)co 7356 0cc0 11024 + caddc 11027 · cmul 11029 +∞cpnf 11161 ≤ cle 11165 [,)cico 13261 Basecbs 17134 +gcplusg 17175 .rcmulr 17176 0gc0g 17357 Ringcrg 20166 AbsValcabv 20739 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-sbc 3739 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-fv 6498 df-ov 7359 df-oprab 7360 df-mpo 7361 df-map 8763 df-abv 20740 |
| This theorem is referenced by: abvne0 20750 abv0 20754 abvmet 24517 |
| Copyright terms: Public domain | W3C validator |