Theorem cnviin 6189

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 6012	. 2 ⊢ Rel ◡∩ 𝑥 ∈ 𝐴 𝐵
2		relcnv 6012	. . . . . . 7 ⊢ Rel ◡𝐵
3		df-rel 5596	. . . . . . 7 ⊢ (Rel ◡𝐵 ↔ ◡𝐵 ⊆ (V × V))
4	2, 3	mpbi 229	. . . . . 6 ⊢ ◡𝐵 ⊆ (V × V)
5	4	rgenw 3076	. . . . 5 ⊢ ∀𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V)
6		r19.2z 4425	. . . . 5 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V)) → ∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
7	5, 6	mpan2 688	. . . 4 ⊢ (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
8		iinss 4986	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V) → ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
9	7, 8	syl 17	. . 3 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
10		df-rel 5596	. . 3 ⊢ (Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
11	9, 10	sylibr 233	. 2 ⊢ (𝐴 ≠ ∅ → Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵)
12		opex 5379	. . . . 5 ⊢ ⟨𝑏, 𝑎⟩ ∈ V
13		eliin 4929	. . . . 5 ⊢ (⟨𝑏, 𝑎⟩ ∈ V → (⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵))
14	12, 13	ax-mp 5	. . . 4 ⊢ (⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
15		vex 3436	. . . . 5 ⊢ 𝑎 ∈ V
16		vex 3436	. . . . 5 ⊢ 𝑏 ∈ V
17	15, 16	opelcnv 5790	. . . 4 ⊢ (⟨𝑎, 𝑏⟩ ∈ ◡∩ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵)
18		opex 5379	. . . . . 6 ⊢ ⟨𝑎, 𝑏⟩ ∈ V
19		eliin 4929	. . . . . 6 ⊢ (⟨𝑎, 𝑏⟩ ∈ V → (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵))
20	18, 19	ax-mp 5	. . . . 5 ⊢ (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵)
21	15, 16	opelcnv 5790	. . . . . 6 ⊢ (⟨𝑎, 𝑏⟩ ∈ ◡𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ 𝐵)
22	21	ralbii 3092	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
23	20, 22	bitri 274	. . . 4 ⊢ (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
24	14, 17, 23	3bitr4i 303	. . 3 ⊢ (⟨𝑎, 𝑏⟩ ∈ ◡∩ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵)
25	24	eqrelriv 5699	. 2 ⊢ ((Rel ◡∩ 𝑥 ∈ 𝐴 𝐵 ∧ Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵) → ◡∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 ◡𝐵)
26	1, 11, 25	sylancr 587	1 ⊢ (𝐴 ≠ ∅ → ◡∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 ◡𝐵)

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1539   ∈ wcel 2106   ≠ wne 2943  ∀wral 3064  ∃wrex 3065  Vcvv 3432   ⊆ wss 3887  ∅c0 4256  ⟨cop 4567  ∩ ciin 4925   × cxp 5587  ^◡ccnv 5588  Rel wrel 5594

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-iin 4927  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597

This theorem is referenced by: (None)