Mathbox for Brendan Leahy |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > unceq | Structured version Visualization version GIF version |
Description: Equality theorem for uncurrying. (Contributed by Brendan Leahy, 2-Jun-2021.) |
Ref | Expression |
---|---|
unceq | ⊢ (𝐴 = 𝐵 → uncurry 𝐴 = uncurry 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq1 6668 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝐴‘𝑥) = (𝐵‘𝑥)) | |
2 | 1 | breqd 5076 | . . 3 ⊢ (𝐴 = 𝐵 → (𝑦(𝐴‘𝑥)𝑧 ↔ 𝑦(𝐵‘𝑥)𝑧)) |
3 | 2 | oprabbidv 7219 | . 2 ⊢ (𝐴 = 𝐵 → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑦(𝐴‘𝑥)𝑧} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑦(𝐵‘𝑥)𝑧}) |
4 | df-unc 7933 | . 2 ⊢ uncurry 𝐴 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑦(𝐴‘𝑥)𝑧} | |
5 | df-unc 7933 | . 2 ⊢ uncurry 𝐵 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑦(𝐵‘𝑥)𝑧} | |
6 | 3, 4, 5 | 3eqtr4g 2881 | 1 ⊢ (𝐴 = 𝐵 → uncurry 𝐴 = uncurry 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 class class class wbr 5065 ‘cfv 6354 {coprab 7156 uncurry cunc 7931 |
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-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-in 3942 df-ss 3951 df-uni 4838 df-br 5066 df-iota 6313 df-fv 6362 df-oprab 7159 df-unc 7933 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |