| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ressplusgd | GIF version | ||
| Description: +g is unaffected by restriction. (Contributed by Stefan O'Rear, 27-Nov-2014.) |
| Ref | Expression |
|---|---|
| ressplusgd.1 | ⊢ (𝜑 → 𝐻 = (𝐺 ↾s 𝐴)) |
| ressplusgd.2 | ⊢ (𝜑 → + = (+g‘𝐺)) |
| ressplusgd.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| ressplusgd.g | ⊢ (𝜑 → 𝐺 ∈ 𝑊) |
| Ref | Expression |
|---|---|
| ressplusgd | ⊢ (𝜑 → + = (+g‘𝐻)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2231 | . . 3 ⊢ (𝐺 ↾s 𝐴) = (𝐺 ↾s 𝐴) | |
| 2 | eqid 2231 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | plusgslid 13200 | . . 3 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 4 | basendxnplusgndx 13213 | . . . 4 ⊢ (Base‘ndx) ≠ (+g‘ndx) | |
| 5 | 4 | necomi 2487 | . . 3 ⊢ (+g‘ndx) ≠ (Base‘ndx) |
| 6 | ressplusgd.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 7 | ressplusgd.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 8 | 1, 2, 3, 5, 6, 7 | resseqnbasd 13161 | . 2 ⊢ (𝜑 → (+g‘𝐺) = (+g‘(𝐺 ↾s 𝐴))) |
| 9 | ressplusgd.2 | . 2 ⊢ (𝜑 → + = (+g‘𝐺)) | |
| 10 | ressplusgd.1 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐺 ↾s 𝐴)) | |
| 11 | 10 | fveq2d 5643 | . 2 ⊢ (𝜑 → (+g‘𝐻) = (+g‘(𝐺 ↾s 𝐴))) |
| 12 | 8, 9, 11 | 3eqtr4d 2274 | 1 ⊢ (𝜑 → + = (+g‘𝐻)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6018 ndxcnx 13084 Basecbs 13087 ↾s cress 13088 +gcplusg 13165 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-pre-ltirr 8144 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-iota 5286 df-fun 5328 df-fv 5334 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-ltxr 8219 df-inn 9144 df-2 9202 df-ndx 13090 df-slot 13091 df-base 13093 df-sets 13094 df-iress 13095 df-plusg 13178 |
| This theorem is referenced by: gsumress 13483 issubmnd 13530 ress0g 13531 resmhm 13575 resmhm2 13576 resmhm2b 13577 grpressid 13649 submmulg 13758 subg0 13772 subginv 13773 subgcl 13776 subgsub 13778 subgmulg 13780 issubg2m 13781 nmznsg 13805 resghm 13852 subgabl 13924 subcmnd 13925 ablressid 13927 rngressid 13973 ringidss 14048 ringressid 14082 opprsubgg 14103 unitgrp 14136 unitlinv 14146 unitrinv 14147 invrpropdg 14169 rhmunitinv 14198 issubrng2 14230 subrngpropd 14236 subrgugrp 14260 issubrg2 14261 subrgpropd 14273 islss3 14399 sralmod 14470 rnglidlrng 14518 zringplusg 14617 expghmap 14627 mplplusgg 14723 |
| Copyright terms: Public domain | W3C validator |