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

Theorem fimarab 6935
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 1914 . 2 𝑦(𝐹:𝐴𝐵𝑋𝐴)
2 nfcv 2891 . 2 𝑦(𝐹𝑋)
3 nfrab1 3426 . 2 𝑦{𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦}
4 ffn 6688 . . . 4 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
5 fvelimab 6933 . . . . 5 ((𝐹 Fn 𝐴𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) ↔ ∃𝑥𝑋 (𝐹𝑥) = 𝑦))
65anbi2d 630 . . . 4 ((𝐹 Fn 𝐴𝑋𝐴) → ((𝑦𝐵𝑦 ∈ (𝐹𝑋)) ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦)))
74, 6sylan 580 . . 3 ((𝐹:𝐴𝐵𝑋𝐴) → ((𝑦𝐵𝑦 ∈ (𝐹𝑋)) ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦)))
8 fimass 6708 . . . . . 6 (𝐹:𝐴𝐵 → (𝐹𝑋) ⊆ 𝐵)
98adantr 480 . . . . 5 ((𝐹:𝐴𝐵𝑋𝐴) → (𝐹𝑋) ⊆ 𝐵)
109sseld 3945 . . . 4 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) → 𝑦𝐵))
1110pm4.71rd 562 . . 3 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) ↔ (𝑦𝐵𝑦 ∈ (𝐹𝑋))))
12 rabid 3427 . . . 4 (𝑦 ∈ {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦} ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦))
1312a1i 11 . . 3 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦} ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦)))
147, 11, 133bitr4d 311 . 2 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) ↔ 𝑦 ∈ {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦}))
151, 2, 3, 14eqrd 3966 1 ((𝐹:𝐴𝐵𝑋𝐴) → (𝐹𝑋) = {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wrex 3053  {crab 3405  wss 3914  cima 5641   Fn wfn 6506  wf 6507  cfv 6511
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519
This theorem is referenced by:  locfinreflem  33830  uspgrlimlem1  47987  uspgrlimlem2  47988
  Copyright terms: Public domain W3C validator