Theorem cnviin 6282

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 6100	. 2 ⊢ Rel ◡∩ 𝑥 ∈ 𝐴 𝐵
2		relcnv 6100	. . . . . . 7 ⊢ Rel ◡𝐵
3		df-rel 5682	. . . . . . 7 ⊢ (Rel ◡𝐵 ↔ ◡𝐵 ⊆ (V × V))
4	2, 3	mpbi 229	. . . . . 6 ⊢ ◡𝐵 ⊆ (V × V)
5	4	rgenw 3065	. . . . 5 ⊢ ∀𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V)
6		r19.2z 4493	. . . . 5 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V)) → ∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
7	5, 6	mpan2 689	. . . 4 ⊢ (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
8		iinss 5058	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V) → ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
9	7, 8	syl 17	. . 3 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
10		df-rel 5682	. . 3 ⊢ (Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
11	9, 10	sylibr 233	. 2 ⊢ (𝐴 ≠ ∅ → Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵)
12		opex 5463	. . . . 5 ⊢ ⟨𝑏, 𝑎⟩ ∈ V
13		eliin 5001	. . . . 5 ⊢ (⟨𝑏, 𝑎⟩ ∈ V → (⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵))
14	12, 13	ax-mp 5	. . . 4 ⊢ (⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
15		vex 3478	. . . . 5 ⊢ 𝑎 ∈ V
16		vex 3478	. . . . 5 ⊢ 𝑏 ∈ V
17	15, 16	opelcnv 5879	. . . 4 ⊢ (⟨𝑎, 𝑏⟩ ∈ ◡∩ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵)
18		opex 5463	. . . . . 6 ⊢ ⟨𝑎, 𝑏⟩ ∈ V
19		eliin 5001	. . . . . 6 ⊢ (⟨𝑎, 𝑏⟩ ∈ V → (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵))
20	18, 19	ax-mp 5	. . . . 5 ⊢ (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵)
21	15, 16	opelcnv 5879	. . . . . 6 ⊢ (⟨𝑎, 𝑏⟩ ∈ ◡𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ 𝐵)
22	21	ralbii 3093	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
23	20, 22	bitri 274	. . . 4 ⊢ (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
24	14, 17, 23	3bitr4i 302	. . 3 ⊢ (⟨𝑎, 𝑏⟩ ∈ ◡∩ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵)
25	24	eqrelriv 5787	. 2 ⊢ ((Rel ◡∩ 𝑥 ∈ 𝐴 𝐵 ∧ Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵) → ◡∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 ◡𝐵)
26	1, 11, 25	sylancr 587	1 ⊢ (𝐴 ≠ ∅ → ◡∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 ◡𝐵)

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1541   ∈ wcel 2106   ≠ wne 2940  ∀wral 3061  ∃wrex 3070  Vcvv 3474   ⊆ wss 3947  ∅c0 4321  ⟨cop 4633  ∩ ciin 4997   × cxp 5673  ^◡ccnv 5674  Rel wrel 5680

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-iin 4999  df-br 5148  df-opab 5210  df-xp 5681  df-rel 5682  df-cnv 5683

This theorem is referenced by: (None)