| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fimarab | Structured version Visualization version GIF version | ||
| Description: Expressing the image of a set as a restricted abstract builder. (Contributed by Thierry Arnoux, 27-Jan-2020.) |
| Ref | Expression |
|---|---|
| fimarab | ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝐹 “ 𝑋) = {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1921 | . 2 ⊢ Ⅎ𝑦(𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) | |
| 2 | nfcv 2902 | . 2 ⊢ Ⅎ𝑦(𝐹 “ 𝑋) | |
| 3 | nfrab1 3412 | . 2 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦} | |
| 4 | ffn 6662 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 5 | fvelimab 6906 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) ↔ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦)) | |
| 6 | 5 | anbi2d 636 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (𝐹 “ 𝑋)) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦))) |
| 7 | 4, 6 | sylan 586 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (𝐹 “ 𝑋)) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦))) |
| 8 | fimass 6682 | . . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 “ 𝑋) ⊆ 𝐵) | |
| 9 | 8 | adantr 481 | . . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝐹 “ 𝑋) ⊆ 𝐵) |
| 10 | 9 | sseld 3921 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) → 𝑦 ∈ 𝐵)) |
| 11 | 10 | pm4.71rd 567 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (𝐹 “ 𝑋)))) |
| 12 | rabid 3413 | . . . 4 ⊢ (𝑦 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦} ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦)) | |
| 13 | 12 | a1i 11 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦} ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦))) |
| 14 | 7, 11, 13 | 3bitr4d 312 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) ↔ 𝑦 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦})) |
| 15 | 1, 2, 3, 14 | eqrd 3941 | 1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝐹 “ 𝑋) = {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∃wrex 3064 {crab 3392 ⊆ wss 3890 “ cima 5628 Fn wfn 6487 ⟶wf 6488 ‘cfv 6492 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 |
| This theorem is referenced by: locfinreflem 34031 uspgrlimlem1 48486 uspgrlimlem2 48487 |
| Copyright terms: Public domain | W3C validator |