Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sloteq | Structured version Visualization version GIF version |
Description: Equality theorem for the Slot construction. The converse holds if 𝐴 (or 𝐵) is a set. (Contributed by BJ, 27-Dec-2021.) |
Ref | Expression |
---|---|
sloteq | ⊢ (𝐴 = 𝐵 → Slot 𝐴 = Slot 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6669 | . . 3 ⊢ (𝐴 = 𝐵 → (𝑓‘𝐴) = (𝑓‘𝐵)) | |
2 | 1 | mpteq2dv 5161 | . 2 ⊢ (𝐴 = 𝐵 → (𝑓 ∈ V ↦ (𝑓‘𝐴)) = (𝑓 ∈ V ↦ (𝑓‘𝐵))) |
3 | df-slot 16486 | . 2 ⊢ Slot 𝐴 = (𝑓 ∈ V ↦ (𝑓‘𝐴)) | |
4 | df-slot 16486 | . 2 ⊢ Slot 𝐵 = (𝑓 ∈ V ↦ (𝑓‘𝐵)) | |
5 | 2, 3, 4 | 3eqtr4g 2881 | 1 ⊢ (𝐴 = 𝐵 → Slot 𝐴 = Slot 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 Vcvv 3494 ↦ cmpt 5145 ‘cfv 6354 Slot cslot 16481 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-mpt 5146 df-iota 6313 df-fv 6362 df-slot 16486 |
This theorem is referenced by: ndxid 16508 |
Copyright terms: Public domain | W3C validator |