| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lspsneq0b | Structured version Visualization version GIF version | ||
| Description: Equal singleton spans imply both arguments are zero or both are nonzero. (Contributed by NM, 21-Mar-2015.) |
| Ref | Expression |
|---|---|
| lspsneq0b.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspsneq0b.o | ⊢ 0 = (0g‘𝑊) |
| lspsneq0b.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lspsneq0b.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lspsneq0b.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| lspsneq0b.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| lspsneq0b.e | ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) |
| Ref | Expression |
|---|---|
| lspsneq0b | ⊢ (𝜑 → (𝑋 = 0 ↔ 𝑌 = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lspsneq0b.e | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) | |
| 2 | 1 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) |
| 3 | lspsneq0b.w | . . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 4 | lspsneq0b.x | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 5 | lspsneq0b.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 6 | lspsneq0b.o | . . . . . . 7 ⊢ 0 = (0g‘𝑊) | |
| 7 | lspsneq0b.n | . . . . . . 7 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 8 | 5, 6, 7 | lspsneq0 21197 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((𝑁‘{𝑋}) = { 0 } ↔ 𝑋 = 0 )) |
| 9 | 3, 4, 8 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑋}) = { 0 } ↔ 𝑋 = 0 )) |
| 10 | 9 | biimpar 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → (𝑁‘{𝑋}) = { 0 }) |
| 11 | 2, 10 | eqtr3d 2797 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → (𝑁‘{𝑌}) = { 0 }) |
| 12 | lspsneq0b.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 13 | 5, 6, 7 | lspsneq0 21197 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ∈ 𝑉) → ((𝑁‘{𝑌}) = { 0 } ↔ 𝑌 = 0 )) |
| 14 | 3, 12, 13 | syl2anc 596 | . . . 4 ⊢ (𝜑 → ((𝑁‘{𝑌}) = { 0 } ↔ 𝑌 = 0 )) |
| 15 | 14 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → ((𝑁‘{𝑌}) = { 0 } ↔ 𝑌 = 0 )) |
| 16 | 11, 15 | mpbid 235 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 0 ) → 𝑌 = 0 ) |
| 17 | 1 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑌 = 0 ) → (𝑁‘{𝑋}) = (𝑁‘{𝑌})) |
| 18 | 14 | biimpar 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑌 = 0 ) → (𝑁‘{𝑌}) = { 0 }) |
| 19 | 17, 18 | eqtrd 2795 | . . 3 ⊢ ((𝜑 ∧ 𝑌 = 0 ) → (𝑁‘{𝑋}) = { 0 }) |
| 20 | 9 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝑌 = 0 ) → ((𝑁‘{𝑋}) = { 0 } ↔ 𝑋 = 0 )) |
| 21 | 19, 20 | mpbid 235 | . 2 ⊢ ((𝜑 ∧ 𝑌 = 0 ) → 𝑋 = 0 ) |
| 22 | 16, 21 | impbida 813 | 1 ⊢ (𝜑 → (𝑋 = 0 ↔ 𝑌 = 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {csn 4584 ‘cfv 6533 Basecbs 17302 0gc0g 17525 LModclmod 21045 LSpanclspn 21156 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-er 8697 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-2 12328 df-sets 17257 df-slot 17275 df-ndx 17287 df-base 17303 df-plusg 17356 df-0g 17527 df-mgm 18731 df-sgrp 18822 df-mnd 18838 df-grp 19061 df-minusg 19062 df-cmn 19910 df-abl 19911 df-mgp 20275 df-rng 20289 df-ur 20322 df-ring 20375 df-lmod 21047 df-lss 21117 df-lsp 21157 |
| This theorem is used by: lspsneq 21310 |
| Copyright terms: Public domain | W3C validator |