| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lspsnsub | GIF version | ||
| Description: Swapping subtraction order does not change the span of a singleton. (Contributed by NM, 4-Apr-2015.) |
| Ref | Expression |
|---|---|
| lspsnsub.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspsnsub.s | ⊢ − = (-g‘𝑊) |
| lspsnsub.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lspsnsub.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lspsnsub.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| lspsnsub.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| lspsnsub | ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) = (𝑁‘{(𝑌 − 𝑋)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lspsnsub.w | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 2 | lspsnsub.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 3 | lspsnsub.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 4 | lspsnsub.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 5 | lspsnsub.s | . . . . 5 ⊢ − = (-g‘𝑊) | |
| 6 | 4, 5 | lmodvsubcl 14408 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) ∈ 𝑉) |
| 7 | 1, 2, 3, 6 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑌) ∈ 𝑉) |
| 8 | eqid 2231 | . . . 4 ⊢ (invg‘𝑊) = (invg‘𝑊) | |
| 9 | lspsnsub.n | . . . 4 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 10 | 4, 8, 9 | lspsnneg 14496 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑋 − 𝑌) ∈ 𝑉) → (𝑁‘{((invg‘𝑊)‘(𝑋 − 𝑌))}) = (𝑁‘{(𝑋 − 𝑌)})) |
| 11 | 1, 7, 10 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝑁‘{((invg‘𝑊)‘(𝑋 − 𝑌))}) = (𝑁‘{(𝑋 − 𝑌)})) |
| 12 | lmodgrp 14370 | . . . . . 6 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Grp) | |
| 13 | 1, 12 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ Grp) |
| 14 | 4, 5, 8 | grpinvsub 13726 | . . . . 5 ⊢ ((𝑊 ∈ Grp ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((invg‘𝑊)‘(𝑋 − 𝑌)) = (𝑌 − 𝑋)) |
| 15 | 13, 2, 3, 14 | syl3anc 1274 | . . . 4 ⊢ (𝜑 → ((invg‘𝑊)‘(𝑋 − 𝑌)) = (𝑌 − 𝑋)) |
| 16 | 15 | sneqd 3686 | . . 3 ⊢ (𝜑 → {((invg‘𝑊)‘(𝑋 − 𝑌))} = {(𝑌 − 𝑋)}) |
| 17 | 16 | fveq2d 5652 | . 2 ⊢ (𝜑 → (𝑁‘{((invg‘𝑊)‘(𝑋 − 𝑌))}) = (𝑁‘{(𝑌 − 𝑋)})) |
| 18 | 11, 17 | eqtr3d 2266 | 1 ⊢ (𝜑 → (𝑁‘{(𝑋 − 𝑌)}) = (𝑁‘{(𝑌 − 𝑋)})) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2202 {csn 3673 ‘cfv 5333 (class class class)co 6028 Basecbs 13143 Grpcgrp 13644 invgcminusg 13645 -gcsg 13646 LModclmod 14363 LSpanclspn 14462 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-pre-ltirr 8187 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-pnf 8259 df-mnf 8260 df-ltxr 8262 df-inn 9187 df-2 9245 df-3 9246 df-4 9247 df-5 9248 df-6 9249 df-ndx 13146 df-slot 13147 df-base 13149 df-sets 13150 df-plusg 13234 df-mulr 13235 df-sca 13237 df-vsca 13238 df-0g 13402 df-mgm 13500 df-sgrp 13546 df-mnd 13561 df-grp 13647 df-minusg 13648 df-sbg 13649 df-mgp 13996 df-ur 14035 df-ring 14073 df-lmod 14365 df-lssm 14429 df-lsp 14463 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |