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

Theorem cnviin 6131
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 5961 . 2 Rel 𝑥𝐴 𝐵
2 relcnv 5961 . . . . . . 7 Rel 𝐵
3 df-rel 5556 . . . . . . 7 (Rel 𝐵𝐵 ⊆ (V × V))
42, 3mpbi 232 . . . . . 6 𝐵 ⊆ (V × V)
54rgenw 3150 . . . . 5 𝑥𝐴 𝐵 ⊆ (V × V)
6 r19.2z 4439 . . . . 5 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵 ⊆ (V × V)) → ∃𝑥𝐴 𝐵 ⊆ (V × V))
75, 6mpan2 689 . . . 4 (𝐴 ≠ ∅ → ∃𝑥𝐴 𝐵 ⊆ (V × V))
8 iinss 4972 . . . 4 (∃𝑥𝐴 𝐵 ⊆ (V × V) → 𝑥𝐴 𝐵 ⊆ (V × V))
97, 8syl 17 . . 3 (𝐴 ≠ ∅ → 𝑥𝐴 𝐵 ⊆ (V × V))
10 df-rel 5556 . . 3 (Rel 𝑥𝐴 𝐵 𝑥𝐴 𝐵 ⊆ (V × V))
119, 10sylibr 236 . 2 (𝐴 ≠ ∅ → Rel 𝑥𝐴 𝐵)
12 opex 5348 . . . . 5 𝑏, 𝑎⟩ ∈ V
13 eliin 4916 . . . . 5 (⟨𝑏, 𝑎⟩ ∈ V → (⟨𝑏, 𝑎⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑏, 𝑎⟩ ∈ 𝐵))
1412, 13ax-mp 5 . . . 4 (⟨𝑏, 𝑎⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑏, 𝑎⟩ ∈ 𝐵)
15 vex 3497 . . . . 5 𝑎 ∈ V
16 vex 3497 . . . . 5 𝑏 ∈ V
1715, 16opelcnv 5746 . . . 4 (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ 𝑥𝐴 𝐵)
18 opex 5348 . . . . . 6 𝑎, 𝑏⟩ ∈ V
19 eliin 4916 . . . . . 6 (⟨𝑎, 𝑏⟩ ∈ V → (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑎, 𝑏⟩ ∈ 𝐵))
2018, 19ax-mp 5 . . . . 5 (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑎, 𝑏⟩ ∈ 𝐵)
2115, 16opelcnv 5746 . . . . . 6 (⟨𝑎, 𝑏⟩ ∈ 𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ 𝐵)
2221ralbii 3165 . . . . 5 (∀𝑥𝐴𝑎, 𝑏⟩ ∈ 𝐵 ↔ ∀𝑥𝐴𝑏, 𝑎⟩ ∈ 𝐵)
2320, 22bitri 277 . . . 4 (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴𝑏, 𝑎⟩ ∈ 𝐵)
2414, 17, 233bitr4i 305 . . 3 (⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵 ↔ ⟨𝑎, 𝑏⟩ ∈ 𝑥𝐴 𝐵)
2524eqrelriv 5656 . 2 ((Rel 𝑥𝐴 𝐵 ∧ Rel 𝑥𝐴 𝐵) → 𝑥𝐴 𝐵 = 𝑥𝐴 𝐵)
261, 11, 25sylancr 589 1 (𝐴 ≠ ∅ → 𝑥𝐴 𝐵 = 𝑥𝐴 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1533  wcel 2110  wne 3016  wral 3138  wrex 3139  Vcvv 3494  wss 3935  c0 4290  cop 4566   ciin 4912   × cxp 5547  ccnv 5548  Rel wrel 5554
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-iin 4914  df-br 5059  df-opab 5121  df-xp 5555  df-rel 5556  df-cnv 5557
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator