ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mptpreima GIF version

Theorem mptpreima 5255
Description: The preimage of a function in maps-to notation. (Contributed by Stefan O'Rear, 25-Jan-2015.)
Hypothesis
Ref Expression
dmmpo.1 𝐹 = (𝑥𝐴𝐵)
Assertion
Ref Expression
mptpreima (𝐹𝐶) = {𝑥𝐴𝐵𝐶}
Distinct variable group:   𝑥,𝐶
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem mptpreima
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dmmpo.1 . . . . . 6 𝐹 = (𝑥𝐴𝐵)
2 df-mpt 4172 . . . . . 6 (𝑥𝐴𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
31, 2eqtri 2253 . . . . 5 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
43cnveqi 4929 . . . 4 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
5 cnvopab 5163 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = {⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
64, 5eqtri 2253 . . 3 𝐹 = {⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
76imaeq1i 5097 . 2 (𝐹𝐶) = ({⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} “ 𝐶)
8 df-ima 4761 . . 3 ({⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} “ 𝐶) = ran ({⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} ↾ 𝐶)
9 resopab 5081 . . . . 5 ({⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} ↾ 𝐶) = {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵))}
109rneqi 4984 . . . 4 ran ({⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} ↾ 𝐶) = ran {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵))}
11 ancom 266 . . . . . . . . 9 ((𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵)) ↔ ((𝑥𝐴𝑦 = 𝐵) ∧ 𝑦𝐶))
12 anass 401 . . . . . . . . 9 (((𝑥𝐴𝑦 = 𝐵) ∧ 𝑦𝐶) ↔ (𝑥𝐴 ∧ (𝑦 = 𝐵𝑦𝐶)))
1311, 12bitri 184 . . . . . . . 8 ((𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵)) ↔ (𝑥𝐴 ∧ (𝑦 = 𝐵𝑦𝐶)))
1413exbii 1654 . . . . . . 7 (∃𝑦(𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵)) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑦 = 𝐵𝑦𝐶)))
15 19.42v 1956 . . . . . . . 8 (∃𝑦(𝑥𝐴 ∧ (𝑦 = 𝐵𝑦𝐶)) ↔ (𝑥𝐴 ∧ ∃𝑦(𝑦 = 𝐵𝑦𝐶)))
16 df-clel 2228 . . . . . . . . . 10 (𝐵𝐶 ↔ ∃𝑦(𝑦 = 𝐵𝑦𝐶))
1716bicomi 132 . . . . . . . . 9 (∃𝑦(𝑦 = 𝐵𝑦𝐶) ↔ 𝐵𝐶)
1817anbi2i 457 . . . . . . . 8 ((𝑥𝐴 ∧ ∃𝑦(𝑦 = 𝐵𝑦𝐶)) ↔ (𝑥𝐴𝐵𝐶))
1915, 18bitri 184 . . . . . . 7 (∃𝑦(𝑥𝐴 ∧ (𝑦 = 𝐵𝑦𝐶)) ↔ (𝑥𝐴𝐵𝐶))
2014, 19bitri 184 . . . . . 6 (∃𝑦(𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵)) ↔ (𝑥𝐴𝐵𝐶))
2120abbii 2348 . . . . 5 {𝑥 ∣ ∃𝑦(𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵))} = {𝑥 ∣ (𝑥𝐴𝐵𝐶)}
22 rnopab 5003 . . . . 5 ran {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵))} = {𝑥 ∣ ∃𝑦(𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵))}
23 df-rab 2529 . . . . 5 {𝑥𝐴𝐵𝐶} = {𝑥 ∣ (𝑥𝐴𝐵𝐶)}
2421, 22, 233eqtr4i 2263 . . . 4 ran {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐶 ∧ (𝑥𝐴𝑦 = 𝐵))} = {𝑥𝐴𝐵𝐶}
2510, 24eqtri 2253 . . 3 ran ({⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} ↾ 𝐶) = {𝑥𝐴𝐵𝐶}
268, 25eqtri 2253 . 2 ({⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} “ 𝐶) = {𝑥𝐴𝐵𝐶}
277, 26eqtri 2253 1 (𝐹𝐶) = {𝑥𝐴𝐵𝐶}
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1398  wex 1541  wcel 2203  {cab 2218  {crab 2524  {copab 4169  cmpt 4170  ccnv 4747  ran crn 4749  cres 4750  cima 4751
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2814  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-br 4109  df-opab 4171  df-mpt 4172  df-xp 4754  df-rel 4755  df-cnv 4756  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761
This theorem is referenced by:  mptiniseg  5256  dmmpt  5257  fmpt  5826  f1oresrab  5841  suppssov1  6262  mptsuppdifd  6454  infrenegsupex  9922  infxrnegsupex  11941  eqglact  13931  fczpsrbag  14807  txcnmpt  15125  txdis1cn  15130  imasnopn  15151
  Copyright terms: Public domain W3C validator