| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ressvalsets | GIF version | ||
| Description: Value of structure restriction. (Contributed by Jim Kingdon, 16-Jan-2025.) |
| Ref | Expression |
|---|---|
| ressvalsets | ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 2825 | . . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V) | |
| 2 | 1 | adantr 276 | . 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑊 ∈ V) |
| 3 | elex 2825 | . . 3 ⊢ (𝐴 ∈ 𝑌 → 𝐴 ∈ V) | |
| 4 | 3 | adantl 277 | . 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝐴 ∈ V) |
| 5 | simpl 109 | . . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑊 ∈ 𝑋) | |
| 6 | basendxnn 13268 | . . . 4 ⊢ (Base‘ndx) ∈ ℕ | |
| 7 | 6 | a1i 9 | . . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (Base‘ndx) ∈ ℕ) |
| 8 | inex1g 4246 | . . . 4 ⊢ (𝐴 ∈ 𝑌 → (𝐴 ∩ (Base‘𝑊)) ∈ V) | |
| 9 | 8 | adantl 277 | . . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝐴 ∩ (Base‘𝑊)) ∈ V) |
| 10 | setsex 13244 | . . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ (Base‘ndx) ∈ ℕ ∧ (𝐴 ∩ (Base‘𝑊)) ∈ V) → (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉) ∈ V) | |
| 11 | 5, 7, 9, 10 | syl3anc 1274 | . 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉) ∈ V) |
| 12 | id 19 | . . . 4 ⊢ (𝑤 = 𝑊 → 𝑤 = 𝑊) | |
| 13 | fveq2 5670 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊)) | |
| 14 | 13 | ineq2d 3422 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑥 ∩ (Base‘𝑤)) = (𝑥 ∩ (Base‘𝑊))) |
| 15 | 14 | opeq2d 3890 | . . . 4 ⊢ (𝑤 = 𝑊 → 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑤))〉 = 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑊))〉) |
| 16 | 12, 15 | oveq12d 6068 | . . 3 ⊢ (𝑤 = 𝑊 → (𝑤 sSet 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑤))〉) = (𝑊 sSet 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑊))〉)) |
| 17 | ineq1 3415 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∩ (Base‘𝑊)) = (𝐴 ∩ (Base‘𝑊))) | |
| 18 | 17 | opeq2d 3890 | . . . 4 ⊢ (𝑥 = 𝐴 → 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑊))〉 = 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉) |
| 19 | 18 | oveq2d 6066 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑊 sSet 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑊))〉) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| 20 | df-iress 13220 | . . 3 ⊢ ↾s = (𝑤 ∈ V, 𝑥 ∈ V ↦ (𝑤 sSet 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑤))〉)) | |
| 21 | 16, 19, 20 | ovmpog 6188 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ V ∧ (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉) ∈ V) → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| 22 | 2, 4, 11, 21 | syl3anc 1274 | 1 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 Vcvv 2813 ∩ cin 3210 〈cop 3692 ‘cfv 5352 (class class class)co 6050 ℕcn 9237 ndxcnx 13209 sSet csts 13210 Basecbs 13212 ↾s cress 13213 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1re 8221 ax-addrcl 8224 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-rab 2529 df-v 2815 df-sbc 3043 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-iota 5312 df-fun 5354 df-fv 5360 df-ov 6053 df-oprab 6054 df-mpo 6055 df-inn 9238 df-ndx 13215 df-slot 13216 df-base 13218 df-sets 13219 df-iress 13220 |
| This theorem is referenced by: ressex 13278 ressval2 13279 ressbasd 13280 strressid 13284 ressval3d 13285 resseqnbasd 13286 ressinbasd 13287 ressressg 13288 mgpress 14075 |
| Copyright terms: Public domain | W3C validator |