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 4547 | . . 3 ⊢ ◡(𝐴 ∪ 𝐵) = {〈𝑥, 𝑦〉 ∣ 𝑦(𝐴 ∪ 𝐵)𝑥} | |
2 | unopab 4007 | . . . 4 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} ∪ {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥}) = {〈𝑥, 𝑦〉 ∣ (𝑦𝐴𝑥 ∨ 𝑦𝐵𝑥)} | |
3 | brun 3979 | . . . . 5 ⊢ (𝑦(𝐴 ∪ 𝐵)𝑥 ↔ (𝑦𝐴𝑥 ∨ 𝑦𝐵𝑥)) | |
4 | 3 | opabbii 3995 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ 𝑦(𝐴 ∪ 𝐵)𝑥} = {〈𝑥, 𝑦〉 ∣ (𝑦𝐴𝑥 ∨ 𝑦𝐵𝑥)} |
5 | 2, 4 | eqtr4i 2163 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} ∪ {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥}) = {〈𝑥, 𝑦〉 ∣ 𝑦(𝐴 ∪ 𝐵)𝑥} |
6 | 1, 5 | eqtr4i 2163 | . 2 ⊢ ◡(𝐴 ∪ 𝐵) = ({〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} ∪ {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥}) |
7 | df-cnv 4547 | . . 3 ⊢ ◡𝐴 = {〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} | |
8 | df-cnv 4547 | . . 3 ⊢ ◡𝐵 = {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥} | |
9 | 7, 8 | uneq12i 3228 | . 2 ⊢ (◡𝐴 ∪ ◡𝐵) = ({〈𝑥, 𝑦〉 ∣ 𝑦𝐴𝑥} ∪ {〈𝑥, 𝑦〉 ∣ 𝑦𝐵𝑥}) |
10 | 6, 9 | eqtr4i 2163 | 1 ⊢ ◡(𝐴 ∪ 𝐵) = (◡𝐴 ∪ ◡𝐵) |
Colors of variables: wff set class |
Syntax hints: ∨ wo 697 = wceq 1331 ∪ cun 3069 class class class wbr 3929 {copab 3988 ◡ccnv 4538 |
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-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-v 2688 df-un 3075 df-br 3930 df-opab 3990 df-cnv 4547 |
This theorem is referenced by: rnun 4947 f1oun 5387 sbthlemi8 6852 caseinj 6974 djuinj 6991 |
Copyright terms: Public domain | W3C validator |