Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mptcnv | GIF version |
Description: The converse of a mapping function. (Contributed by Thierry Arnoux, 16-Jan-2017.) |
Ref | Expression |
---|---|
mptcnv.1 | ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐷))) |
Ref | Expression |
---|---|
mptcnv | ⊢ (𝜑 → ◡(𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐶 ↦ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mptcnv.1 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐷))) | |
2 | 1 | opabbidv 3989 | . 2 ⊢ (𝜑 → {〈𝑦, 𝑥〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐷)}) |
3 | df-mpt 3986 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} | |
4 | 3 | cnveqi 4709 | . . 3 ⊢ ◡(𝑥 ∈ 𝐴 ↦ 𝐵) = ◡{〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} |
5 | cnvopab 4935 | . . 3 ⊢ ◡{〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {〈𝑦, 𝑥〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} | |
6 | 4, 5 | eqtri 2158 | . 2 ⊢ ◡(𝑥 ∈ 𝐴 ↦ 𝐵) = {〈𝑦, 𝑥〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} |
7 | df-mpt 3986 | . 2 ⊢ (𝑦 ∈ 𝐶 ↦ 𝐷) = {〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐶 ∧ 𝑥 = 𝐷)} | |
8 | 2, 6, 7 | 3eqtr4g 2195 | 1 ⊢ (𝜑 → ◡(𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐶 ↦ 𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∈ wcel 1480 {copab 3983 ↦ cmpt 3984 ◡ccnv 4533 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 df-rex 2420 df-v 2683 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-br 3925 df-opab 3985 df-mpt 3986 df-xp 4540 df-rel 4541 df-cnv 4542 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |