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

Theorem fimarab 6916
Description: Expressing the image of a set as a restricted abstract builder. (Contributed by Thierry Arnoux, 27-Jan-2020.)
Assertion
Ref Expression
fimarab ((𝐹:𝐴𝐵𝑋𝐴) → (𝐹𝑋) = {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦})
Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑥,𝐹,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem fimarab
StepHypRef Expression
1 nfv 1916 . 2 𝑦(𝐹:𝐴𝐵𝑋𝐴)
2 nfcv 2899 . 2 𝑦(𝐹𝑋)
3 nfrab1 3421 . 2 𝑦{𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦}
4 ffn 6670 . . . 4 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
5 fvelimab 6914 . . . . 5 ((𝐹 Fn 𝐴𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) ↔ ∃𝑥𝑋 (𝐹𝑥) = 𝑦))
65anbi2d 631 . . . 4 ((𝐹 Fn 𝐴𝑋𝐴) → ((𝑦𝐵𝑦 ∈ (𝐹𝑋)) ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦)))
74, 6sylan 581 . . 3 ((𝐹:𝐴𝐵𝑋𝐴) → ((𝑦𝐵𝑦 ∈ (𝐹𝑋)) ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦)))
8 fimass 6690 . . . . . 6 (𝐹:𝐴𝐵 → (𝐹𝑋) ⊆ 𝐵)
98adantr 480 . . . . 5 ((𝐹:𝐴𝐵𝑋𝐴) → (𝐹𝑋) ⊆ 𝐵)
109sseld 3934 . . . 4 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) → 𝑦𝐵))
1110pm4.71rd 562 . . 3 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) ↔ (𝑦𝐵𝑦 ∈ (𝐹𝑋))))
12 rabid 3422 . . . 4 (𝑦 ∈ {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦} ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦))
1312a1i 11 . . 3 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦} ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦)))
147, 11, 133bitr4d 311 . 2 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) ↔ 𝑦 ∈ {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦}))
151, 2, 3, 14eqrd 3955 1 ((𝐹:𝐴𝐵𝑋𝐴) → (𝐹𝑋) = {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wrex 3062  {crab 3401  wss 3903  cima 5635   Fn wfn 6495  wf 6496  cfv 6500
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508
This theorem is referenced by:  locfinreflem  34017  uspgrlimlem1  48342  uspgrlimlem2  48343
  Copyright terms: Public domain W3C validator