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 6755 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝐴‘𝑥) = (𝐵‘𝑥)) | |
2 | 1 | breqd 5081 | . . 3 ⊢ (𝐴 = 𝐵 → (𝑦(𝐴‘𝑥)𝑧 ↔ 𝑦(𝐵‘𝑥)𝑧)) |
3 | 2 | oprabbidv 7319 | . 2 ⊢ (𝐴 = 𝐵 → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑦(𝐴‘𝑥)𝑧} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑦(𝐵‘𝑥)𝑧}) |
4 | df-unc 8055 | . 2 ⊢ uncurry 𝐴 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑦(𝐴‘𝑥)𝑧} | |
5 | df-unc 8055 | . 2 ⊢ uncurry 𝐵 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝑦(𝐵‘𝑥)𝑧} | |
6 | 3, 4, 5 | 3eqtr4g 2804 | 1 ⊢ (𝐴 = 𝐵 → uncurry 𝐴 = uncurry 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 class class class wbr 5070 ‘cfv 6418 {coprab 7256 uncurry cunc 8053 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1542 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-v 3424 df-in 3890 df-ss 3900 df-uni 4837 df-br 5071 df-iota 6376 df-fv 6426 df-oprab 7259 df-unc 8055 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |