MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cnviin Structured version   Visualization version   GIF version

Theorem cnviin 6233
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.
StepHypRef Expression
1 relcnv 6052 . 2 Rel 𝑥𝐴 𝐵
2 relcnv 6052 . . . . . . 7 Rel 𝐵
3 df-rel 5621 . . . . . . 7 (Rel 𝐵𝐵 ⊆ (V × V))
42, 3mpbi 230 . . . . . 6 𝐵 ⊆ (V × V)
54rgenw 3051 . . . . 5 𝑥𝐴 𝐵 ⊆ (V × V)
6 r19.2z 4442 . . . . 5 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵 ⊆ (V × V)) → ∃𝑥𝐴 𝐵 ⊆ (V × V))
75, 6mpan2 691 . . . 4 (𝐴 ≠ ∅ → ∃𝑥𝐴 𝐵 ⊆ (V × V))
8 iinss 5003 . . . 4 (∃𝑥𝐴 𝐵 ⊆ (V × V) → 𝑥𝐴 𝐵 ⊆ (V × V))
97, 8syl 17 . . 3 (𝐴 ≠ ∅ → 𝑥𝐴 𝐵 ⊆ (V × V))
10 df-rel 5621 . . 3 (Rel 𝑥𝐴 𝐵 𝑥𝐴 𝐵 ⊆ (V × V))
119, 10sylibr 234 . 2 (𝐴 ≠ ∅ → Rel 𝑥𝐴 𝐵)
12 opex 5402 . . . . 5 𝑏, 𝑎⟩ ∈ V
13 eliin 4944 . . . . 5 (⟨𝑏, 𝑎⟩ ∈ V → (⟨𝑏, 𝑎⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑏, 𝑎⟩ ∈ 𝐵))
1412, 13ax-mp 5 . . . 4 (⟨𝑏, 𝑎⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑏, 𝑎⟩ ∈ 𝐵)
15 vex 3440 . . . . 5 𝑎 ∈ V
16 vex 3440 . . . . 5 𝑏 ∈ V
1715, 16opelcnv 5820 . . . 4 (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ 𝑥𝐴 𝐵)
18 opex 5402 . . . . . 6 𝑎, 𝑏⟩ ∈ V
19 eliin 4944 . . . . . 6 (⟨𝑎, 𝑏⟩ ∈ V → (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑎, 𝑏⟩ ∈ 𝐵))
2018, 19ax-mp 5 . . . . 5 (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑎, 𝑏⟩ ∈ 𝐵)
2115, 16opelcnv 5820 . . . . . 6 (⟨𝑎, 𝑏⟩ ∈ 𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ 𝐵)
2221ralbii 3078 . . . . 5 (∀𝑥𝐴𝑎, 𝑏⟩ ∈ 𝐵 ↔ ∀𝑥𝐴𝑏, 𝑎⟩ ∈ 𝐵)
2320, 22bitri 275 . . . 4 (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑏, 𝑎⟩ ∈ 𝐵)
2414, 17, 233bitr4i 303 . . 3 (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵)
2524eqrelriv 5728 . 2 ((Rel 𝑥𝐴 𝐵 ∧ Rel 𝑥𝐴 𝐵) → 𝑥𝐴 𝐵 = 𝑥𝐴 𝐵)
261, 11, 25sylancr 587 1 (𝐴 ≠ ∅ → 𝑥𝐴 𝐵 = 𝑥𝐴 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1541  wcel 2111  wne 2928  wral 3047  wrex 3056  Vcvv 3436  wss 3897  c0 4280  cop 4579   ciin 4940   × cxp 5612  ccnv 5613  Rel wrel 5619
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-iin 4942  df-br 5090  df-opab 5152  df-xp 5620  df-rel 5621  df-cnv 5622
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator