| 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 13401 | . . . . . 6 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑉) → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) | |
| 6 | 3, 4, 5 | syl2anc 415 | . . . . 5 ⊢ (𝜑 → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| 7 | 2, 6 | eqtrid 2283 | . . . 4 ⊢ (𝜑 → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
| 8 | 7 | fveq2d 5697 | . . 3 ⊢ (𝜑 → (𝐸‘𝑅) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 9 | inex1g 4267 | . . . . 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 13391 | . . . . 5 ⊢ (Base‘ndx) ∈ ℕ | |
| 14 | 11, 12, 13 | setsslnid 13387 | . . . 4 ⊢ ((𝑊 ∈ 𝑋 ∧ (𝐴 ∩ (Base‘𝑊)) ∈ V) → (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 15 | 3, 10, 14 | syl2anc 415 | . . 3 ⊢ (𝜑 → (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 16 | 8, 15 | eqtr4d 2274 | . 2 ⊢ (𝜑 → (𝐸‘𝑅) = (𝐸‘𝑊)) |
| 17 | 1, 16 | eqtr4id 2290 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 Vcvv 2821 ∩ cin 3219 〈cop 3711 ‘cfv 5375 (class class class)co 6079 ℕcn 9287 ndxcnx 13332 sSet csts 13333 Slot cslot 13334 Basecbs 13335 ↾s cress 13336 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1re 8267 ax-addrcl 8270 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-iota 5335 df-fun 5377 df-fv 5383 df-ov 6082 df-oprab 6083 df-mpo 6084 df-inn 9288 df-ndx 13338 df-slot 13339 df-base 13341 df-sets 13342 df-iress 13343 |
| This theorem is referenced by: ressplusgd 13466 ressmulrg 13482 ressscag 13520 ressvscag 13521 ressipg 13522 |
| Copyright terms: Public domain | W3C validator |