Theorem cnvin 5151

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.

Step	Hyp	Ref	Expression
1		df-cnv 4739	. . 3 ⊢ ◡(𝐴 ∩ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ 𝑦(𝐴 ∩ 𝐵)𝑥}
2		inopab 4868	. . . 4 ⊢ ({⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ∩ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥}) = {⟨𝑥, 𝑦⟩ ∣ (𝑦𝐴𝑥 ∧ 𝑦𝐵𝑥)}
3		brin 4146	. . . . 5 ⊢ (𝑦(𝐴 ∩ 𝐵)𝑥 ↔ (𝑦𝐴𝑥 ∧ 𝑦𝐵𝑥))
4	3	opabbii 4161	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑦(𝐴 ∩ 𝐵)𝑥} = {⟨𝑥, 𝑦⟩ ∣ (𝑦𝐴𝑥 ∧ 𝑦𝐵𝑥)}
5	2, 4	eqtr4i 2255	. . 3 ⊢ ({⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ∩ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥}) = {⟨𝑥, 𝑦⟩ ∣ 𝑦(𝐴 ∩ 𝐵)𝑥}
6	1, 5	eqtr4i 2255	. 2 ⊢ ◡(𝐴 ∩ 𝐵) = ({⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ∩ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥})
7		df-cnv 4739	. . 3 ⊢ ◡𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥}
8		df-cnv 4739	. . 3 ⊢ ◡𝐵 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥}
9	7, 8	ineq12i 3408	. 2 ⊢ (◡𝐴 ∩ ◡𝐵) = ({⟨𝑥, 𝑦⟩ ∣ 𝑦𝐴𝑥} ∩ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝐵𝑥})
10	6, 9	eqtr4i 2255	1 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵)

Syntax hints:   ∧ wa 104   = wceq 1398   ∩ cin 3200   class class class wbr 4093  {copab 4154  ^◡ccnv 4730

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-xp 4737  df-rel 4738  df-cnv 4739

This theorem is referenced by:  rnin  5153  dminxp  5188  imainrect  5189  cnvcnv  5196