Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnvin GIF version

Theorem cnvin 4759
 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.)
Assertion
Ref Expression
cnvin (𝐴𝐵) = (𝐴𝐵)

Proof of Theorem cnvin
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-cnv 4381 . . 3 (𝐴𝐵) = {⟨𝑥, 𝑦⟩ ∣ 𝑦(𝐴𝐵)𝑥}
2 inopab 4496 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ∩ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥}) = {⟨𝑥, 𝑦⟩ ∣ (𝑦𝐴𝑥𝑦𝐵𝑥)}
3 brin 3839 . . . . 5 (𝑦(𝐴𝐵)𝑥 ↔ (𝑦𝐴𝑥𝑦𝐵𝑥))
43opabbii 3852 . . . 4 {⟨𝑥, 𝑦⟩ ∣ 𝑦(𝐴𝐵)𝑥} = {⟨𝑥, 𝑦⟩ ∣ (𝑦𝐴𝑥𝑦𝐵𝑥)}
52, 4eqtr4i 2079 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ∩ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥}) = {⟨𝑥, 𝑦⟩ ∣ 𝑦(𝐴𝐵)𝑥}
61, 5eqtr4i 2079 . 2 (𝐴𝐵) = ({⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ∩ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥})
7 df-cnv 4381 . . 3 𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥}
8 df-cnv 4381 . . 3 𝐵 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥}
97, 8ineq12i 3164 . 2 (𝐴𝐵) = ({⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ∩ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥})
106, 9eqtr4i 2079 1 (𝐴𝐵) = (𝐴𝐵)
 Colors of variables: wff set class Syntax hints:   ∧ wa 101   = wceq 1259   ∩ cin 2944   class class class wbr 3792  {copab 3845  ◡ccnv 4372 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3903  ax-pow 3955  ax-pr 3972 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-v 2576  df-un 2950  df-in 2952  df-ss 2959  df-pw 3389  df-sn 3409  df-pr 3410  df-op 3412  df-br 3793  df-opab 3847  df-xp 4379  df-rel 4380  df-cnv 4381 This theorem is referenced by:  rnin  4761  dminxp  4793  imainrect  4794  cnvcnv  4801
 Copyright terms: Public domain W3C validator