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

Theorem inpreima 7063
Description: Preimage of an intersection. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 14-Jun-2016.)
Assertion
Ref Expression
inpreima (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)))

Proof of Theorem inpreima
StepHypRef Expression
1 funcnvcnv 6607 . 2 (Fun 𝐹 → Fun ◡◡𝐹)
2 imain 6625 . 2 (Fun ◡◡𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)))
31, 2syl 18 1 (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∩ cin 4089  ◡ccnv 5649   “ cima 5653  Fun wfun 6532
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-fun 6540
This theorem is used by:  cnvimainrn  7066  sspreima  7067  fimacnvinrn  7071  fsuppeq  8195  fsuppeqg  8196  ofco2  22771  cnrest2  23609  cnhaus  23677  kgencn3  23882  qtoptop2  24023  basqtop  24035  ismbfd  25965  mbfimaopn2  25983  i1fima  26004  i1fima2  26005  i1fd  26007  disjpreima  33225  smfco  47905  predisj  50014
  Copyright terms: Public domain W3C validator