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

Theorem inpreima 7090
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 6632 . 2 (Fun 𝐹 → Fun ◡◡𝐹)
2 imain 6650 . 2 (Fun ◡◡𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)))
31, 2syl 18 1 (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 4092  ◡ccnv 5655   “ cima 5659  Fun wfun 6555
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-fun 6563
This theorem is used by:  cnvimainrn  7093  sspreima  7094  fimacnvinrn  7098  fsuppeq  8223  fsuppeqg  8224  ofco2  22799  cnrest2  23637  cnhaus  23705  kgencn3  23910  qtoptop2  24051  basqtop  24063  ismbfd  25993  mbfimaopn2  26011  i1fima  26032  i1fima2  26033  i1fd  26035  disjpreima  33253  smfco  48027  predisj  50136
  Copyright terms: Public domain W3C validator