| 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 13149 | . . . . . 6 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑉) → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) | |
| 6 | 3, 4, 5 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| 7 | 2, 6 | eqtrid 2276 | . . . 4 ⊢ (𝜑 → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| 8 | 7 | fveq2d 5643 | . . 3 ⊢ (𝜑 → (𝐸‘𝑅) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 9 | inex1g 4225 | . . . . 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 13140 | . . . . 5 ⊢ (Base‘ndx) ∈ ℕ | |
| 14 | 11, 12, 13 | setsslnid 13136 | . . . 4 ⊢ ((𝑊 ∈ 𝑋 ∧ (𝐴 ∩ (Base‘𝑊)) ∈ V) → (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 15 | 3, 10, 14 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 16 | 8, 15 | eqtr4d 2267 | . 2 ⊢ (𝜑 → (𝐸‘𝑅) = (𝐸‘𝑊)) |
| 17 | 1, 16 | eqtr4id 2283 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ≠ wne 2402 Vcvv 2802 ∩ cin 3199 〈cop 3672 ‘cfv 5326 (class class class)co 6018 ℕcn 9143 ndxcnx 13081 sSet csts 13082 Slot cslot 13083 Basecbs 13084 ↾s cress 13085 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1re 8126 ax-addrcl 8129 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-iota 5286 df-fun 5328 df-fv 5334 df-ov 6021 df-oprab 6022 df-mpo 6023 df-inn 9144 df-ndx 13087 df-slot 13088 df-base 13090 df-sets 13091 df-iress 13092 |
| This theorem is referenced by: ressplusgd 13214 ressmulrg 13230 ressscag 13268 ressvscag 13269 ressipg 13270 |
| Copyright terms: Public domain | W3C validator |