| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > strressid | GIF version | ||
| Description: Behavior of trivial restriction. (Contributed by Stefan O'Rear, 29-Nov-2014.) (Revised by Jim Kingdon, 17-Jan-2025.) |
| Ref | Expression |
|---|---|
| strressid.b | ⊢ (𝜑 → 𝐵 = (Base‘𝑊)) |
| strressid.s | ⊢ (𝜑 → 𝑊 Struct 〈𝑀, 𝑁〉) |
| strressid.f | ⊢ (𝜑 → Fun 𝑊) |
| strressid.bw | ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝑊) |
| Ref | Expression |
|---|---|
| strressid | ⊢ (𝜑 → (𝑊 ↾s 𝐵) = 𝑊) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | strressid.b | . . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝑊)) | |
| 2 | 1 | ineq1d 3372 | . . . . 5 ⊢ (𝜑 → (𝐵 ∩ (Base‘𝑊)) = ((Base‘𝑊) ∩ (Base‘𝑊))) |
| 3 | inidm 3381 | . . . . 5 ⊢ ((Base‘𝑊) ∩ (Base‘𝑊)) = (Base‘𝑊) | |
| 4 | 2, 3 | eqtrdi 2253 | . . . 4 ⊢ (𝜑 → (𝐵 ∩ (Base‘𝑊)) = (Base‘𝑊)) |
| 5 | 4 | opeq2d 3825 | . . 3 ⊢ (𝜑 → 〈(Base‘ndx), (𝐵 ∩ (Base‘𝑊))〉 = 〈(Base‘ndx), (Base‘𝑊)〉) |
| 6 | 5 | oveq2d 5950 | . 2 ⊢ (𝜑 → (𝑊 sSet 〈(Base‘ndx), (𝐵 ∩ (Base‘𝑊))〉) = (𝑊 sSet 〈(Base‘ndx), (Base‘𝑊)〉)) |
| 7 | strressid.s | . . . 4 ⊢ (𝜑 → 𝑊 Struct 〈𝑀, 𝑁〉) | |
| 8 | structex 12763 | . . . 4 ⊢ (𝑊 Struct 〈𝑀, 𝑁〉 → 𝑊 ∈ V) | |
| 9 | 7, 8 | syl 14 | . . 3 ⊢ (𝜑 → 𝑊 ∈ V) |
| 10 | basfn 12809 | . . . . 5 ⊢ Base Fn V | |
| 11 | funfvex 5587 | . . . . . 6 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V) | |
| 12 | 11 | funfni 5370 | . . . . 5 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V) |
| 13 | 10, 9, 12 | sylancr 414 | . . . 4 ⊢ (𝜑 → (Base‘𝑊) ∈ V) |
| 14 | 1, 13 | eqeltrd 2281 | . . 3 ⊢ (𝜑 → 𝐵 ∈ V) |
| 15 | ressvalsets 12815 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝐵 ∈ V) → (𝑊 ↾s 𝐵) = (𝑊 sSet 〈(Base‘ndx), (𝐵 ∩ (Base‘𝑊))〉)) | |
| 16 | 9, 14, 15 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝑊 ↾s 𝐵) = (𝑊 sSet 〈(Base‘ndx), (𝐵 ∩ (Base‘𝑊))〉)) |
| 17 | baseid 12805 | . . 3 ⊢ Base = Slot (Base‘ndx) | |
| 18 | strressid.f | . . 3 ⊢ (𝜑 → Fun 𝑊) | |
| 19 | strressid.bw | . . 3 ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝑊) | |
| 20 | 17, 7, 18, 19 | strsetsid 12784 | . 2 ⊢ (𝜑 → 𝑊 = (𝑊 sSet 〈(Base‘ndx), (Base‘𝑊)〉)) |
| 21 | 6, 16, 20 | 3eqtr4d 2247 | 1 ⊢ (𝜑 → (𝑊 ↾s 𝐵) = 𝑊) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1372 ∈ wcel 2175 Vcvv 2771 ∩ cin 3164 〈cop 3635 class class class wbr 4043 dom cdm 4673 Fun wfun 5262 Fn wfn 5263 ‘cfv 5268 (class class class)co 5934 Struct cstr 12747 ndxcnx 12748 sSet csts 12749 Basecbs 12751 ↾s cress 12752 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4478 ax-setind 4583 ax-cnex 7998 ax-resscn 7999 ax-1cn 8000 ax-1re 8001 ax-icn 8002 ax-addcl 8003 ax-addrcl 8004 ax-mulcl 8005 ax-addcom 8007 ax-addass 8009 ax-distr 8011 ax-i2m1 8012 ax-0lt1 8013 ax-0id 8015 ax-rnegex 8016 ax-cnre 8018 ax-pre-ltirr 8019 ax-pre-ltwlin 8020 ax-pre-lttrn 8021 ax-pre-ltadd 8023 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-nel 2471 df-ral 2488 df-rex 2489 df-reu 2490 df-rab 2492 df-v 2773 df-sbc 2998 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-int 3885 df-br 4044 df-opab 4105 df-mpt 4106 df-id 4338 df-xp 4679 df-rel 4680 df-cnv 4681 df-co 4682 df-dm 4683 df-rn 4684 df-res 4685 df-ima 4686 df-iota 5229 df-fun 5270 df-fn 5271 df-f 5272 df-f1 5273 df-fo 5274 df-f1o 5275 df-fv 5276 df-riota 5889 df-ov 5937 df-oprab 5938 df-mpo 5939 df-pnf 8091 df-mnf 8092 df-xr 8093 df-ltxr 8094 df-le 8095 df-sub 8227 df-neg 8228 df-inn 9019 df-n0 9278 df-z 9355 df-uz 9631 df-fz 10113 df-struct 12753 df-ndx 12754 df-slot 12755 df-base 12757 df-sets 12758 df-iress 12759 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |