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

Theorem inpreima 7055
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 6599 . 2 (Fun 𝐹 → Fun ◡◡𝐹)
2 imain 6617 . 2 (Fun ◡◡𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)))
31, 2syl 18 1 (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 3898  ◡ccnv 5650   “ cima 5654  Fun wfun 6525
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391
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 2100  df-mo 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-fun 6533
This theorem is used by:  cnvimainrn  7058  sspreima  7059  fimacnvinrn  7063  fsuppeq  8176  fsuppeqg  8177  ofco2  22746  cnrest2  23584  cnhaus  23652  kgencn3  23857  qtoptop2  23998  basqtop  24010  ismbfd  25940  mbfimaopn2  25958  i1fima  25979  i1fima2  25980  i1fd  25982  disjpreima  33160  smfco  47756  predisj  49865
  Copyright terms: Public domain W3C validator