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

Theorem fimarab 6914
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 2898 . 2 𝑦(𝐹𝑋)
3 nfrab1 3409 . 2 𝑦{𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦}
4 ffn 6668 . . . 4 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
5 fvelimab 6912 . . . . 5 ((𝐹 Fn 𝐴𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) ↔ ∃𝑥𝑋 (𝐹𝑥) = 𝑦))
65anbi2d 631 . . . 4 ((𝐹 Fn 𝐴𝑋𝐴) → ((𝑦𝐵𝑦 ∈ (𝐹𝑋)) ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦)))
74, 6sylan 581 . . 3 ((𝐹:𝐴𝐵𝑋𝐴) → ((𝑦𝐵𝑦 ∈ (𝐹𝑋)) ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦)))
8 fimass 6688 . . . . . 6 (𝐹:𝐴𝐵 → (𝐹𝑋) ⊆ 𝐵)
98adantr 480 . . . . 5 ((𝐹:𝐴𝐵𝑋𝐴) → (𝐹𝑋) ⊆ 𝐵)
109sseld 3920 . . . 4 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) → 𝑦𝐵))
1110pm4.71rd 562 . . 3 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) ↔ (𝑦𝐵𝑦 ∈ (𝐹𝑋))))
12 rabid 3410 . . . 4 (𝑦 ∈ {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦} ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦))
1312a1i 11 . . 3 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦} ↔ (𝑦𝐵 ∧ ∃𝑥𝑋 (𝐹𝑥) = 𝑦)))
147, 11, 133bitr4d 311 . 2 ((𝐹:𝐴𝐵𝑋𝐴) → (𝑦 ∈ (𝐹𝑋) ↔ 𝑦 ∈ {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦}))
151, 2, 3, 14eqrd 3941 1 ((𝐹:𝐴𝐵𝑋𝐴) → (𝐹𝑋) = {𝑦𝐵 ∣ ∃𝑥𝑋 (𝐹𝑥) = 𝑦})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wrex 3061  {crab 3389  wss 3889  cima 5634   Fn wfn 6493  wf 6494  cfv 6498
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 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506
This theorem is referenced by:  locfinreflem  33984  uspgrlimlem1  48464  uspgrlimlem2  48465
  Copyright terms: Public domain W3C validator