| 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 2815 | . . 3 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V) | |
| 2 | 1 | adantr 276 | . 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑊 ∈ V) |
| 3 | elex 2815 | . . 3 ⊢ (𝐴 ∈ 𝑌 → 𝐴 ∈ V) | |
| 4 | 3 | adantl 277 | . 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝐴 ∈ V) |
| 5 | simpl 109 | . . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑊 ∈ 𝑋) | |
| 6 | basendxnn 13218 | . . . 4 ⊢ (Base‘ndx) ∈ ℕ | |
| 7 | 6 | a1i 9 | . . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (Base‘ndx) ∈ ℕ) |
| 8 | inex1g 4230 | . . . 4 ⊢ (𝐴 ∈ 𝑌 → (𝐴 ∩ (Base‘𝑊)) ∈ V) | |
| 9 | 8 | adantl 277 | . . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝐴 ∩ (Base‘𝑊)) ∈ V) |
| 10 | setsex 13194 | . . 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 5648 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊)) | |
| 14 | 13 | ineq2d 3410 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑥 ∩ (Base‘𝑤)) = (𝑥 ∩ (Base‘𝑊))) |
| 15 | 14 | opeq2d 3874 | . . . 4 ⊢ (𝑤 = 𝑊 → 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑤))〉 = 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑊))〉) |
| 16 | 12, 15 | oveq12d 6046 | . . 3 ⊢ (𝑤 = 𝑊 → (𝑤 sSet 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑤))〉) = (𝑊 sSet 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑊))〉)) |
| 17 | ineq1 3403 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∩ (Base‘𝑊)) = (𝐴 ∩ (Base‘𝑊))) | |
| 18 | 17 | opeq2d 3874 | . . . 4 ⊢ (𝑥 = 𝐴 → 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑊))〉 = 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉) |
| 19 | 18 | oveq2d 6044 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑊 sSet 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑊))〉) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| 20 | df-iress 13170 | . . 3 ⊢ ↾s = (𝑤 ∈ V, 𝑥 ∈ V ↦ (𝑤 sSet 〈(Base‘ndx), (𝑥 ∩ (Base‘𝑤))〉)) | |
| 21 | 16, 19, 20 | ovmpog 6166 | . 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 2202 Vcvv 2803 ∩ cin 3200 〈cop 3676 ‘cfv 5333 (class class class)co 6028 ℕcn 9202 ndxcnx 13159 sSet csts 13160 Basecbs 13162 ↾s cress 13163 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8183 ax-resscn 8184 ax-1re 8186 ax-addrcl 8189 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-iota 5293 df-fun 5335 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-inn 9203 df-ndx 13165 df-slot 13166 df-base 13168 df-sets 13169 df-iress 13170 |
| This theorem is referenced by: ressex 13228 ressval2 13229 ressbasd 13230 strressid 13234 ressval3d 13235 resseqnbasd 13236 ressinbasd 13237 ressressg 13238 mgpress 14025 |
| Copyright terms: Public domain | W3C validator |