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

Theorem cnvresima 6185
Description: An image under the converse of a restriction. (Contributed by Jeff Hankins, 12-Jul-2009.)
Assertion
Ref Expression
cnvresima ((𝐹𝐴) “ 𝐵) = ((𝐹𝐵) ∩ 𝐴)

Proof of Theorem cnvresima
Dummy variables 𝑡 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.41v 1957 . . . 4 (∃𝑠((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴) ↔ (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
2 vex 3437 . . . . . . . 8 𝑠 ∈ V
32opelresi 5946 . . . . . . 7 (⟨𝑡, 𝑠⟩ ∈ (𝐹𝐴) ↔ (𝑡𝐴 ∧ ⟨𝑡, 𝑠⟩ ∈ 𝐹))
4 vex 3437 . . . . . . . 8 𝑡 ∈ V
52, 4opelcnv 5826 . . . . . . 7 (⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴) ↔ ⟨𝑡, 𝑠⟩ ∈ (𝐹𝐴))
62, 4opelcnv 5826 . . . . . . . 8 (⟨𝑠, 𝑡⟩ ∈ 𝐹 ↔ ⟨𝑡, 𝑠⟩ ∈ 𝐹)
76anbi2ci 632 . . . . . . 7 ((⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴) ↔ (𝑡𝐴 ∧ ⟨𝑡, 𝑠⟩ ∈ 𝐹))
83, 5, 73bitr4i 305 . . . . . 6 (⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴) ↔ (⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴))
98bianass 649 . . . . 5 ((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ ((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
109exbii 1856 . . . 4 (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ ∃𝑠((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
114elima3 6026 . . . . 5 (𝑡 ∈ (𝐹𝐵) ↔ ∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹))
1211anbi1i 631 . . . 4 ((𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴) ↔ (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
131, 10, 123bitr4i 305 . . 3 (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ (𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴))
144elima3 6026 . . 3 (𝑡 ∈ ((𝐹𝐴) “ 𝐵) ↔ ∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)))
15 elin 3901 . . 3 (𝑡 ∈ ((𝐹𝐵) ∩ 𝐴) ↔ (𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴))
1613, 14, 153bitr4i 305 . 2 (𝑡 ∈ ((𝐹𝐴) “ 𝐵) ↔ 𝑡 ∈ ((𝐹𝐵) ∩ 𝐴))
1716eqriv 2738 1 ((𝐹𝐴) “ 𝐵) = ((𝐹𝐵) ∩ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wa 397   = wceq 1548  wex 1787  wcel 2121  cin 3884  cop 4564  ccnv 5620  cres 5623  cima 5624
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713  ax-sep 5221  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-br 5076  df-opab 5138  df-xp 5627  df-cnv 5629  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634
This theorem is referenced by:  fimacnvinrn  7016  ramub2  16980  ramub1lem2  16993  cnrest  23272  kgencn  23543  kgencn3  23545  xkoptsub  23641  qtopres  23685  qtoprest  23704  mbfid  25624  mbfres  25633  1stpreima  32803  2ndpreima  32804  gsumhashmul  33152  cvmsss2  35517  lmhmlnmsplit  43547
  Copyright terms: Public domain W3C validator