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

Theorem cnvresima 6089
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 1950 . . . 4 (∃𝑠((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴) ↔ (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
2 vex 3499 . . . . . . . 8 𝑠 ∈ V
32opelresi 5863 . . . . . . 7 (⟨𝑡, 𝑠⟩ ∈ (𝐹𝐴) ↔ (𝑡𝐴 ∧ ⟨𝑡, 𝑠⟩ ∈ 𝐹))
4 vex 3499 . . . . . . . 8 𝑡 ∈ V
52, 4opelcnv 5754 . . . . . . 7 (⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴) ↔ ⟨𝑡, 𝑠⟩ ∈ (𝐹𝐴))
62, 4opelcnv 5754 . . . . . . . 8 (⟨𝑠, 𝑡⟩ ∈ 𝐹 ↔ ⟨𝑡, 𝑠⟩ ∈ 𝐹)
76anbi2ci 626 . . . . . . 7 ((⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴) ↔ (𝑡𝐴 ∧ ⟨𝑡, 𝑠⟩ ∈ 𝐹))
83, 5, 73bitr4i 305 . . . . . 6 (⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴) ↔ (⟨𝑠, 𝑡⟩ ∈ 𝐹𝑡𝐴))
98bianass 640 . . . . 5 ((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ ((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
109exbii 1848 . . . 4 (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ ∃𝑠((𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
114elima3 5938 . . . . 5 (𝑡 ∈ (𝐹𝐵) ↔ ∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹))
1211anbi1i 625 . . . 4 ((𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴) ↔ (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ 𝐹) ∧ 𝑡𝐴))
131, 10, 123bitr4i 305 . . 3 (∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)) ↔ (𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴))
144elima3 5938 . . 3 (𝑡 ∈ ((𝐹𝐴) “ 𝐵) ↔ ∃𝑠(𝑠𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ (𝐹𝐴)))
15 elin 4171 . . 3 (𝑡 ∈ ((𝐹𝐵) ∩ 𝐴) ↔ (𝑡 ∈ (𝐹𝐵) ∧ 𝑡𝐴))
1613, 14, 153bitr4i 305 . 2 (𝑡 ∈ ((𝐹𝐴) “ 𝐵) ↔ 𝑡 ∈ ((𝐹𝐵) ∩ 𝐴))
1716eqriv 2820 1 ((𝐹𝐴) “ 𝐵) = ((𝐹𝐵) ∩ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wa 398   = wceq 1537  wex 1780  wcel 2114  cin 3937  cop 4575  ccnv 5556  cres 5559  cima 5560
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-br 5069  df-opab 5131  df-xp 5563  df-cnv 5565  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570
This theorem is referenced by:  fimacnvinrn  6842  ramub2  16352  ramub1lem2  16365  cnrest  21895  kgencn  22166  kgencn3  22168  xkoptsub  22264  qtopres  22308  qtoprest  22327  mbfid  24238  mbfres  24247  1stpreima  30444  2ndpreima  30445  cvmsss2  32523  lmhmlnmsplit  39694
  Copyright terms: Public domain W3C validator