| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > resseqnbasd | GIF version | ||
| Description: The components of an extensible structure except the base set remain unchanged on a structure restriction. (Contributed by Mario Carneiro, 26-Nov-2014.) (Revised by Mario Carneiro, 2-Dec-2014.) (Revised by AV, 19-Oct-2024.) |
| Ref | Expression |
|---|---|
| resseqnbas.r | ⊢ 𝑅 = (𝑊 ↾s 𝐴) |
| resseqnbas.e | ⊢ 𝐶 = (𝐸‘𝑊) |
| resseqnbasd.f | ⊢ (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ) |
| resseqnbas.n | ⊢ (𝐸‘ndx) ≠ (Base‘ndx) |
| resseqnbasd.w | ⊢ (𝜑 → 𝑊 ∈ 𝑋) |
| resseqnbasd.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| resseqnbasd | ⊢ (𝜑 → 𝐶 = (𝐸‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resseqnbas.e | . 2 ⊢ 𝐶 = (𝐸‘𝑊) | |
| 2 | resseqnbas.r | . . . . 5 ⊢ 𝑅 = (𝑊 ↾s 𝐴) | |
| 3 | resseqnbasd.w | . . . . . 6 ⊢ (𝜑 → 𝑊 ∈ 𝑋) | |
| 4 | resseqnbasd.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 5 | ressvalsets 13364 | . . . . . 6 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑉) → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) | |
| 6 | 3, 4, 5 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| 7 | 2, 6 | eqtrid 2279 | . . . 4 ⊢ (𝜑 → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| 8 | 7 | fveq2d 5679 | . . 3 ⊢ (𝜑 → (𝐸‘𝑅) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 9 | inex1g 4251 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ (Base‘𝑊)) ∈ V) | |
| 10 | 4, 9 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐴 ∩ (Base‘𝑊)) ∈ V) |
| 11 | resseqnbasd.f | . . . . 5 ⊢ (𝐸 = Slot (𝐸‘ndx) ∧ (𝐸‘ndx) ∈ ℕ) | |
| 12 | resseqnbas.n | . . . . 5 ⊢ (𝐸‘ndx) ≠ (Base‘ndx) | |
| 13 | basendxnn 13355 | . . . . 5 ⊢ (Base‘ndx) ∈ ℕ | |
| 14 | 11, 12, 13 | setsslnid 13351 | . . . 4 ⊢ ((𝑊 ∈ 𝑋 ∧ (𝐴 ∩ (Base‘𝑊)) ∈ V) → (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 15 | 3, 10, 14 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 16 | 8, 15 | eqtr4d 2270 | . 2 ⊢ (𝜑 → (𝐸‘𝑅) = (𝐸‘𝑊)) |
| 17 | 1, 16 | eqtr4id 2286 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ≠ wne 2414 Vcvv 2815 ∩ cin 3213 〈cop 3697 ‘cfv 5357 (class class class)co 6058 ℕcn 9257 ndxcnx 13296 sSet csts 13297 Slot cslot 13298 Basecbs 13299 ↾s cress 13300 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1re 8237 ax-addrcl 8240 |
| 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 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-sbc 3046 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-iota 5317 df-fun 5359 df-fv 5365 df-ov 6061 df-oprab 6062 df-mpo 6063 df-inn 9258 df-ndx 13302 df-slot 13303 df-base 13305 df-sets 13306 df-iress 13307 |
| This theorem is referenced by: ressplusgd 13429 ressmulrg 13445 ressscag 13483 ressvscag 13484 ressipg 13485 |
| Copyright terms: Public domain | W3C validator |