Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cnvun | GIF version |
Description: The converse of a union is the union of converses. Theorem 16 of [Suppes] p. 62. (Contributed by NM, 25-Mar-1998.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
Ref | Expression |
---|---|
cnvun | ⊢ ◡(𝐴 ∪ 𝐵) = (◡𝐴 ∪ ◡𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-cnv 4371 | . . 3 ⊢ ◡(𝐴 ∪ 𝐵) = {〈𝑥, 𝑦〉 ∣ 𝑦(𝐴 ∪ 𝐵)𝑥} | |
2 | unopab 3857 | . . . 4 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} ∪ {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥}) = {〈𝑥, 𝑦〉 ∣ (𝑦𝐴𝑥 ∨ 𝑦𝐵𝑥)} | |
3 | brun 3831 | . . . . 5 ⊢ (𝑦(𝐴 ∪ 𝐵)𝑥 ↔ (𝑦𝐴𝑥 ∨ 𝑦𝐵𝑥)) | |
4 | 3 | opabbii 3845 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ 𝑦(𝐴 ∪ 𝐵)𝑥} = {〈𝑥, 𝑦〉 ∣ (𝑦𝐴𝑥 ∨ 𝑦𝐵𝑥)} |
5 | 2, 4 | eqtr4i 2104 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} ∪ {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥}) = {〈𝑥, 𝑦〉 ∣ 𝑦(𝐴 ∪ 𝐵)𝑥} |
6 | 1, 5 | eqtr4i 2104 | . 2 ⊢ ◡(𝐴 ∪ 𝐵) = ({〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} ∪ {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥}) |
7 | df-cnv 4371 | . . 3 ⊢ ◡𝐴 = {〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} | |
8 | df-cnv 4371 | . . 3 ⊢ ◡𝐵 = {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥} | |
9 | 7, 8 | uneq12i 3124 | . 2 ⊢ (◡𝐴 ∪ ◡𝐵) = ({〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} ∪ {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥}) |
10 | 6, 9 | eqtr4i 2104 | 1 ⊢ ◡(𝐴 ∪ 𝐵) = (◡𝐴 ∪ ◡𝐵) |
Colors of variables: wff set class |
Syntax hints: ∨ wo 661 = wceq 1284 ∪ cun 2971 class class class wbr 3785 {copab 3838 ◡ccnv 4362 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-v 2603 df-un 2977 df-br 3786 df-opab 3840 df-cnv 4371 |
This theorem is referenced by: rnun 4752 f1oun 5166 |
Copyright terms: Public domain | W3C validator |