Theorem cnviin 6243

Description: The converse of an intersection is the intersection of the converse. (Contributed by FL, 15-Oct-2012.)

Assertion

Ref	Expression
cnviin	⊢ (𝐴 ≠ ∅ → ◡∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 ◡𝐵)

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem cnviin

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relcnv 6062	. 2 ⊢ Rel ◡∩ 𝑥 ∈ 𝐴 𝐵
2		relcnv 6062	. . . . . . 7 ⊢ Rel ◡𝐵
3		df-rel 5630	. . . . . . 7 ⊢ (Rel ◡𝐵 ↔ ◡𝐵 ⊆ (V × V))
4	2, 3	mpbi 230	. . . . . 6 ⊢ ◡𝐵 ⊆ (V × V)
5	4	rgenw 3054	. . . . 5 ⊢ ∀𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V)
6		r19.2z 4451	. . . . 5 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V)) → ∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
7	5, 6	mpan2 692	. . . 4 ⊢ (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
8		iinss 5011	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V) → ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
9	7, 8	syl 17	. . 3 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
10		df-rel 5630	. . 3 ⊢ (Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
11	9, 10	sylibr 234	. 2 ⊢ (𝐴 ≠ ∅ → Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵)
12		opex 5411	. . . . 5 ⊢ ⟨𝑏, 𝑎⟩ ∈ V
13		eliin 4950	. . . . 5 ⊢ (⟨𝑏, 𝑎⟩ ∈ V → (⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵))
14	12, 13	ax-mp 5	. . . 4 ⊢ (⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
15		vex 3443	. . . . 5 ⊢ 𝑎 ∈ V
16		vex 3443	. . . . 5 ⊢ 𝑏 ∈ V
17	15, 16	opelcnv 5829	. . . 4 ⊢ (⟨𝑎, 𝑏⟩ ∈ ◡∩ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵)
18		opex 5411	. . . . . 6 ⊢ ⟨𝑎, 𝑏⟩ ∈ V
19		eliin 4950	. . . . . 6 ⊢ (⟨𝑎, 𝑏⟩ ∈ V → (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵))
20	18, 19	ax-mp 5	. . . . 5 ⊢ (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵)
21	15, 16	opelcnv 5829	. . . . . 6 ⊢ (⟨𝑎, 𝑏⟩ ∈ ◡𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ 𝐵)
22	21	ralbii 3081	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
23	20, 22	bitri 275	. . . 4 ⊢ (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
24	14, 17, 23	3bitr4i 303	. . 3 ⊢ (⟨𝑎, 𝑏⟩ ∈ ◡∩ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵)
25	24	eqrelriv 5737	. 2 ⊢ ((Rel ◡∩ 𝑥 ∈ 𝐴 𝐵 ∧ Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵) → ◡∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 ◡𝐵)
26	1, 11, 25	sylancr 588	1 ⊢ (𝐴 ≠ ∅ → ◡∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 ◡𝐵)

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1542   ∈ wcel 2114   ≠ wne 2931  ∀wral 3050  ∃wrex 3059  Vcvv 3439   ⊆ wss 3900  ∅c0 4284  ⟨cop 4585  ∩ ciin 4946   × cxp 5621  ^◡ccnv 5622  Rel wrel 5628

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-dif 3903  df-un 3905  df-ss 3917  df-nul 4285  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-iin 4948  df-br 5098  df-opab 5160  df-xp 5629  df-rel 5630  df-cnv 5631

This theorem is referenced by: (None)