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

Theorem cnviin 6312
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 6117 . 2 Rel ◡∩ 𝑥 ∈ 𝐴 𝐵
2 relcnv 6117 . . . . . . 7 Rel ◡𝐵
3 df-rel 5664 . . . . . . 7 (Rel ◡𝐵 ↔ ◡𝐵 ⊆ (V × V))
42, 3mpbi 233 . . . . . 6 ◡𝐵 ⊆ (V × V)
54rgenw 3087 . . . . 5 ∀𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V)
6 r19.2z 4457 . . . . 5 ((𝐴 ≠ ∅ ∧ ∀𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V)) → ∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
75, 6mpan2 704 . . . 4 (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
8 iinss 5019 . . . 4 (∃𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V) → ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
97, 8syl 18 . . 3 (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
10 df-rel 5664 . . 3 (Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ⊆ (V × V))
119, 10sylibr 237 . 2 (𝐴 ≠ ∅ → Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵)
12 opex 5438 . . . . 5 ⟨𝑏, 𝑎⟩ ∈ V
13 eliin 4960 . . . . 5 (⟨𝑏, 𝑎⟩ ∈ V → (⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵))
1412, 13ax-mp 5 . . . 4 (⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
15 vex 3457 . . . . 5 𝑎 ∈ V
16 vex 3457 . . . . 5 𝑏 ∈ V
1715, 16opelcnv 5870 . . . 4 (⟨𝑎, 𝑏⟩ ∈ ◡∩ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ ∩ 𝑥 ∈ 𝐴 𝐵)
18 opex 5438 . . . . . 6 ⟨𝑎, 𝑏⟩ ∈ V
19 eliin 4960 . . . . . 6 (⟨𝑎, 𝑏⟩ ∈ V → (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵))
2018, 19ax-mp 5 . . . . 5 (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵)
2115, 16opelcnv 5870 . . . . . 6 (⟨𝑎, 𝑏⟩ ∈ ◡𝐵 ↔ ⟨𝑏, 𝑎⟩ ∈ 𝐵)
2221ralbii 3115 . . . . 5 (∀𝑥 ∈ 𝐴 ⟨𝑎, 𝑏⟩ ∈ ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
2320, 22bitri 278 . . . 4 (⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵 ↔ ∀𝑥 ∈ 𝐴 ⟨𝑏, 𝑎⟩ ∈ 𝐵)
2414, 17, 233bitr4i 306 . . 3 (⟨𝑎, 𝑏⟩ ∈ ◡∩ 𝑥 ∈ 𝐴 𝐵 ↔ ⟨𝑎, 𝑏⟩ ∈ ∩ 𝑥 ∈ 𝐴 ◡𝐵)
2524eqrelriv 5773 . 2 ((Rel ◡∩ 𝑥 ∈ 𝐴 𝐵 ∧ Rel ∩ 𝑥 ∈ 𝐴 ◡𝐵) → ◡∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 ◡𝐵)
261, 11, 25sylancr 599 1 (𝐴 ≠ ∅ → ◡∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 ◡𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  ∀wral 3083  ∃wrex 3093  Vcvv 3453   ⊆ wss 3899  ∅c0 4280  ⟨cop 4839  ∩ ciin 4956   × cxp 5655  ◡ccnv 5656  Rel wrel 5662
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738  ax-sep 5254  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-iin 4958  df-br 5108  df-opab 5173  df-xp 5663  df-rel 5664  df-cnv 5665
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator