| 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 2229 | . . 3 ⊢ (𝐺 ↾s 𝐴) = (𝐺 ↾s 𝐴) | |
| 2 | eqid 2229 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | plusgslid 13140 | . . 3 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 4 | basendxnplusgndx 13153 | . . . 4 ⊢ (Base‘ndx) ≠ (+g‘ndx) | |
| 5 | 4 | necomi 2485 | . . 3 ⊢ (+g‘ndx) ≠ (Base‘ndx) |
| 6 | ressplusgd.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 7 | ressplusgd.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 8 | 1, 2, 3, 5, 6, 7 | resseqnbasd 13101 | . 2 ⊢ (𝜑 → (+g‘𝐺) = (+g‘(𝐺 ↾s 𝐴))) |
| 9 | ressplusgd.2 | . 2 ⊢ (𝜑 → + = (+g‘𝐺)) | |
| 10 | ressplusgd.1 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐺 ↾s 𝐴)) | |
| 11 | 10 | fveq2d 5630 | . 2 ⊢ (𝜑 → (+g‘𝐻) = (+g‘(𝐺 ↾s 𝐴))) |
| 12 | 8, 9, 11 | 3eqtr4d 2272 | 1 ⊢ (𝜑 → + = (+g‘𝐻)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 ‘cfv 5317 (class class class)co 6000 ndxcnx 13024 Basecbs 13027 ↾s cress 13028 +gcplusg 13105 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-cnex 8086 ax-resscn 8087 ax-1cn 8088 ax-1re 8089 ax-icn 8090 ax-addcl 8091 ax-addrcl 8092 ax-mulcl 8093 ax-addcom 8095 ax-addass 8097 ax-i2m1 8100 ax-0lt1 8101 ax-0id 8103 ax-rnegex 8104 ax-pre-ltirr 8107 ax-pre-ltadd 8111 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-br 4083 df-opab 4145 df-mpt 4146 df-id 4383 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-iota 5277 df-fun 5319 df-fv 5325 df-ov 6003 df-oprab 6004 df-mpo 6005 df-pnf 8179 df-mnf 8180 df-ltxr 8182 df-inn 9107 df-2 9165 df-ndx 13030 df-slot 13031 df-base 13033 df-sets 13034 df-iress 13035 df-plusg 13118 |
| This theorem is referenced by: gsumress 13423 issubmnd 13470 ress0g 13471 resmhm 13515 resmhm2 13516 resmhm2b 13517 grpressid 13589 submmulg 13698 subg0 13712 subginv 13713 subgcl 13716 subgsub 13718 subgmulg 13720 issubg2m 13721 nmznsg 13745 resghm 13792 subgabl 13864 subcmnd 13865 ablressid 13867 rngressid 13912 ringidss 13987 ringressid 14021 opprsubgg 14042 unitgrp 14074 unitlinv 14084 unitrinv 14085 invrpropdg 14107 rhmunitinv 14136 issubrng2 14168 subrngpropd 14174 subrgugrp 14198 issubrg2 14199 subrgpropd 14211 islss3 14337 sralmod 14408 rnglidlrng 14456 zringplusg 14555 expghmap 14565 mplplusgg 14661 |
| Copyright terms: Public domain | W3C validator |