| 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 3405 | . . . . 5 ⊢ (𝜑 → (𝐵 ∩ (Base‘𝑊)) = ((Base‘𝑊) ∩ (Base‘𝑊))) |
| 3 | inidm 3414 | . . . . 5 ⊢ ((Base‘𝑊) ∩ (Base‘𝑊)) = (Base‘𝑊) | |
| 4 | 2, 3 | eqtrdi 2278 | . . . 4 ⊢ (𝜑 → (𝐵 ∩ (Base‘𝑊)) = (Base‘𝑊)) |
| 5 | 4 | opeq2d 3867 | . . 3 ⊢ (𝜑 → 〈(Base‘ndx), (𝐵 ∩ (Base‘𝑊))〉 = 〈(Base‘ndx), (Base‘𝑊)〉) |
| 6 | 5 | oveq2d 6029 | . 2 ⊢ (𝜑 → (𝑊 sSet 〈(Base‘ndx), (𝐵 ∩ (Base‘𝑊))〉) = (𝑊 sSet 〈(Base‘ndx), (Base‘𝑊)〉)) |
| 7 | strressid.s | . . . 4 ⊢ (𝜑 → 𝑊 Struct 〈𝑀, 𝑁〉) | |
| 8 | structex 13084 | . . . 4 ⊢ (𝑊 Struct 〈𝑀, 𝑁〉 → 𝑊 ∈ V) | |
| 9 | 7, 8 | syl 14 | . . 3 ⊢ (𝜑 → 𝑊 ∈ V) |
| 10 | basfn 13131 | . . . . 5 ⊢ Base Fn V | |
| 11 | funfvex 5652 | . . . . . 6 ⊢ ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V) | |
| 12 | 11 | funfni 5429 | . . . . 5 ⊢ ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V) |
| 13 | 10, 9, 12 | sylancr 414 | . . . 4 ⊢ (𝜑 → (Base‘𝑊) ∈ V) |
| 14 | 1, 13 | eqeltrd 2306 | . . 3 ⊢ (𝜑 → 𝐵 ∈ V) |
| 15 | ressvalsets 13137 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝐵 ∈ V) → (𝑊 ↾s 𝐵) = (𝑊 sSet 〈(Base‘ndx), (𝐵 ∩ (Base‘𝑊))〉)) | |
| 16 | 9, 14, 15 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝑊 ↾s 𝐵) = (𝑊 sSet 〈(Base‘ndx), (𝐵 ∩ (Base‘𝑊))〉)) |
| 17 | baseid 13126 | . . 3 ⊢ Base = Slot (Base‘ndx) | |
| 18 | strressid.f | . . 3 ⊢ (𝜑 → Fun 𝑊) | |
| 19 | strressid.bw | . . 3 ⊢ (𝜑 → (Base‘ndx) ∈ dom 𝑊) | |
| 20 | 17, 7, 18, 19 | strsetsid 13105 | . 2 ⊢ (𝜑 → 𝑊 = (𝑊 sSet 〈(Base‘ndx), (Base‘𝑊)〉)) |
| 21 | 6, 16, 20 | 3eqtr4d 2272 | 1 ⊢ (𝜑 → (𝑊 ↾s 𝐵) = 𝑊) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 Vcvv 2800 ∩ cin 3197 〈cop 3670 class class class wbr 4086 dom cdm 4723 Fun wfun 5318 Fn wfn 5319 ‘cfv 5324 (class class class)co 6013 Struct cstr 13068 ndxcnx 13069 sSet csts 13070 Basecbs 13072 ↾s cress 13073 |
| 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 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-ltadd 8138 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 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-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-inn 9134 df-n0 9393 df-z 9470 df-uz 9746 df-fz 10234 df-struct 13074 df-ndx 13075 df-slot 13076 df-base 13078 df-sets 13079 df-iress 13080 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |