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

Theorem cnvresima 6192
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 1951 . . . 4 (∃𝑠((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴) ↔ (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
2 vex 3434 . . . . . . . 8 𝑠 ∈ V
32opelresi 5950 . . . . . . 7 (⟨𝑡, 𝑠⟩ ∈ (𝐹𝐴) ↔ (𝑡𝐴 ∧ ⟨𝑡, 𝑠⟩ ∈ 𝐹))
4 vex 3434 . . . . . . . 8 𝑡 ∈ V
52, 4opelcnv 5834 . . . . . . 7 (⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴) ↔ ⟨𝑡, 𝑠⟩ ∈ (𝐹𝐴))
62, 4opelcnv 5834 . . . . . . . 8 (⟨𝑠, 𝑡⟩ ∈ 𝐹 ↔ ⟨𝑡, 𝑠⟩ ∈ 𝐹)
76anbi2ci 626 . . . . . . 7 ((⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴) ↔ (𝑡𝐴 ∧ ⟨𝑡, 𝑠⟩ ∈ 𝐹))
83, 5, 73bitr4i 303 . . . . . 6 (⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴) ↔ (⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴))
98bianass 643 . . . . 5 ((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ ((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
109exbii 1850 . . . 4 (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ ∃𝑠((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
114elima3 6030 . . . . 5 (𝑡 ∈ (𝐹𝐵) ↔ ∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹))
1211anbi1i 625 . . . 4 ((𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴) ↔ (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
131, 10, 123bitr4i 303 . . 3 (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ (𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴))
144elima3 6030 . . 3 (𝑡 ∈ ((𝐹𝐴) “ 𝐵) ↔ ∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)))
15 elin 3906 . . 3 (𝑡 ∈ ((𝐹𝐵) ∩ 𝐴) ↔ (𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴))
1613, 14, 153bitr4i 303 . 2 (𝑡 ∈ ((𝐹𝐴) “ 𝐵) ↔ 𝑡 ∈ ((𝐹𝐵) ∩ 𝐴))
1716eqriv 2734 1 ((𝐹𝐴) “ 𝐵) = ((𝐹𝐵) ∩ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1542  wex 1781  wcel 2114  cin 3889  cop 4574  ccnv 5627  cres 5630  cima 5631
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5232  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-xp 5634  df-cnv 5636  df-dm 5638  df-rn 5639  df-res 5640  df-ima 5641
This theorem is referenced by:  fimacnvinrn  7021  ramub2  16982  ramub1lem2  16995  cnrest  23266  kgencn  23537  kgencn3  23539  xkoptsub  23635  qtopres  23679  qtoprest  23698  mbfid  25618  mbfres  25627  1stpreima  32801  2ndpreima  32802  gsumhashmul  33149  cvmsss2  35478  lmhmlnmsplit  43541
  Copyright terms: Public domain W3C validator