| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: If a product is zero, one of its factors must be zero. Theorem I.11 of [Apostol] p. 18. |
| Ref | Expression |
|---|---|
| mul0or.1 | ⊢ A ∈ ℂ |
| mul0or.2 | ⊢ B ∈ ℂ |
| Ref | Expression |
|---|---|
| mul0or | ⊢ ((A · B) = 0 ↔ (A = 0 ⋁ B = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ne 1584 | . . . . 5 ⊢ (A ≠ 0 ↔ ¬ A = 0) | |
| 2 | mul0or.1 | . . . . . . . . 9 ⊢ A ∈ ℂ | |
| 3 | mul0or.2 | . . . . . . . . 9 ⊢ B ∈ ℂ | |
| 4 | 0cn 5308 | . . . . . . . . 9 ⊢ 0 ∈ ℂ | |
| 5 | 2, 3, 4 | 3pm3.2i 817 | . . . . . . . 8 ⊢ (A ∈ ℂ ⋀ B ∈ ℂ ⋀ 0 ∈ ℂ) |
| 6 | mulcant 5669 | . . . . . . . 8 ⊢ (((A ∈ ℂ ⋀ B ∈ ℂ ⋀ 0 ∈ ℂ) ⋀ A ≠ 0) → ((A · B) = (A · 0) ↔ B = 0)) | |
| 7 | 5, 6 | mpan 694 | . . . . . . 7 ⊢ (A ≠ 0 → ((A · B) = (A · 0) ↔ B = 0)) |
| 8 | 2 | mul01 5411 | . . . . . . . 8 ⊢ (A · 0) = 0 |
| 9 | 8 | eqeq2i 1482 | . . . . . . 7 ⊢ ((A · B) = (A · 0) ↔ (A · B) = 0) |
| 10 | 7, 9 | syl5bbr 533 | . . . . . 6 ⊢ (A ≠ 0 → ((A · B) = 0 ↔ B = 0)) |
| 11 | 10 | biimpd 153 | . . . . 5 ⊢ (A ≠ 0 → ((A · B) = 0 → B = 0)) |
| 12 | 1, 11 | sylbir 201 | . . . 4 ⊢ (¬ A = 0 → ((A · B) = 0 → B = 0)) |
| 13 | 12 | com12 11 | . . 3 ⊢ ((A · B) = 0 → (¬ A = 0 → B = 0)) |
| 14 | 13 | orrd 233 | . 2 ⊢ ((A · B) = 0 → (A = 0 ⋁ B = 0)) |
| 15 | opreq1 3959 | . . . 4 ⊢ (A = 0 → (A · B) = (0 · B)) | |
| 16 | 3 | mul02 5412 | . . . 4 ⊢ (0 · B) = 0 |
| 17 | 15, 16 | syl6eq 1520 | . . 3 ⊢ (A = 0 → (A · B) = 0) |
| 18 | opreq2 3960 | . . . 4 ⊢ (B = 0 → (A · B) = (A · 0)) | |
| 19 | 18, 8 | syl6eq 1520 | . . 3 ⊢ (B = 0 → (A · B) = 0) |
| 20 | 17, 19 | jaoi 341 | . 2 ⊢ ((A = 0 ⋁ B = 0) → (A · B) = 0) |
| 21 | 14, 20 | impbi 157 | 1 ⊢ ((A · B) = 0 ↔ (A = 0 ⋁ B = 0)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 2 → wi 3 ↔ wb 146 ⋁ wo 222 ⋀ w3a 774 = wceq 954 ∈ wcel 956 ≠ wne 1582 (class class class)co 3954 ℂcc 5212 0cc0 5214 · cmul 5219 |
| This theorem is referenced by: msq0 5672 mul0ort 5673 eqneg 5768 sqeqor 6586 sinhalfpilem 8617 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 960 ax-gen 961 ax-8 962 ax-9 963 ax-10 964 ax-11 965 ax-12 966 ax-13 967 ax-14 968 ax-17 969 ax-4 971 ax-5o 973 ax-6o 976 ax-9o 1121 ax-10o 1138 ax-16 1208 ax-11o 1216 ax-ext 1457 ax-rep 2688 ax-sep 2698 ax-nul 2705 ax-pow 2737 ax-pr 2774 ax-un 2861 ax-inf2 4605 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3or 775 df-3an 776 df-ex 979 df-sb 1170 df-eu 1380 df-mo 1381 df-clab 1462 df-cleq 1467 df-clel 1470 df-ne 1584 df-nel 1585 df-ral 1646 df-rex 1647 df-reu 1648 df-rab 1649 df-v 1808 df-sbc 1938 df-csb 1998 df-dif 2045 df-un 2046 df-in 2047 df-ss 2049 df-pss 2051 df-nul 2277 df-if 2358 df-pw 2398 df-sn 2408 df-pr 2409 df-tp 2411 df-op 2412 df-uni 2499 df-int 2529 df-iun 2563 df-br 2615 df-opab 2662 df-tr 2676 df-eprel 2827 df-id 2830 df-po 2835 df-so 2845 df-fr 2912 df-we 2929 df-ord 2946 df-on 2947 df-lim 2948 df-suc 2949 df-om 3127 df-xp 3179 df-rel 3180 df-cnv 3181 df-co 3182 df-dm 3183 df-rn 3184 df-res 3185 df-ima 3186 df-fun 3187 df-fn 3188 df-f 3189 df-f1 3190 df-fo 3191 df-f1o 3192 df-fv 3193 df-rdg 3923 df-opr 3956 df-oprab 3957 df-1st 4069 df-2nd 4070 df-1o 4123 df-oadd 4125 df-omul 4126 df-er 4251 df-ec 4253 df-qs 4256 df-en 4357 df-dom 4358 df-sdom 4359 df-ni 4980 df-pli 4981 df-mi 4982 df-lti 4983 df-plpq 5015 df-mpq 5016 df-enq 5017 df-nq 5018 df-plq 5019 df-mq 5020 df-rq 5021 df-ltq 5022 df-1q 5023 df-np 5066 df-1p 5067 df-plp 5068 df-mp 5069 df-ltp 5070 df-plpr 5144 df-mpr 5145 df-enr 5146 df-nr 5147 df-plr 5148 df-mr 5149 df-ltr 5150 df-0r 5151 df-1r 5152 df-m1r 5153 df-c 5220 df-0 5221 df-1 5222 df-i 5223 df-r 5224 df-plus 5225 df-mul 5226 df-lt 5227 df-sub 5336 df-neg 5338 df-pnf 5467 df-mnf 5468 df-xr 5469 df-ltxr 5470 df-le 5471 |