| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnvin | Structured version Visualization version GIF version | ||
| Description: Distributive law for converse over intersection. Theorem 15 of [Suppes] p. 62. (Contributed by NM, 25-Mar-1998.) (Revised by Mario Carneiro, 26-Jun-2014.) |
| Ref | Expression |
|---|---|
| cnvin | ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvdif 6095 | . . 3 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵)) | |
| 2 | cnvdif 6095 | . . . 4 ⊢ ◡(𝐴 ∖ 𝐵) = (◡𝐴 ∖ ◡𝐵) | |
| 3 | 2 | difeq2i 4055 | . . 3 ⊢ (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵)) |
| 4 | 1, 3 | eqtri 2762 | . 2 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵)) |
| 5 | dfin4 4207 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐴 ∖ (𝐴 ∖ 𝐵)) | |
| 6 | 5 | cnveqi 5817 | . 2 ⊢ ◡(𝐴 ∩ 𝐵) = ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) |
| 7 | dfin4 4207 | . 2 ⊢ (◡𝐴 ∩ ◡𝐵) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵)) | |
| 8 | 4, 6, 7 | 3eqtr4i 2772 | 1 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1547 ∖ cdif 3880 ∩ cin 3882 ◡ccnv 5618 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5219 ax-pr 5363 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4263 df-if 4456 df-sn 4557 df-pr 4559 df-op 4563 df-br 5074 df-opab 5136 df-xp 5625 df-rel 5626 df-cnv 5627 |
| This theorem is referenced by: rnin 6098 dminxp 6132 imainrect 6133 cnvcnv 6144 cnvrescnv 6147 pjdm 21683 ordtrest2 23188 ustexsym 24200 trust 24213 ordtcnvNEW 34113 ordtrest2NEW 34116 msrf 35779 elrn3 35999 pprodcnveq 36118 tposrescnv 49377 |
| Copyright terms: Public domain | W3C validator |