| 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 1916 | . 2 ⊢ Ⅎ𝑦(𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) | |
| 2 | nfcv 2899 | . 2 ⊢ Ⅎ𝑦(𝐹 “ 𝑋) | |
| 3 | nfrab1 3410 | . 2 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦} | |
| 4 | ffn 6662 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 5 | fvelimab 6906 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) ↔ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦)) | |
| 6 | 5 | anbi2d 631 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (𝐹 “ 𝑋)) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦))) |
| 7 | 4, 6 | sylan 581 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (𝐹 “ 𝑋)) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦))) |
| 8 | fimass 6682 | . . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 “ 𝑋) ⊆ 𝐵) | |
| 9 | 8 | adantr 480 | . . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝐹 “ 𝑋) ⊆ 𝐵) |
| 10 | 9 | sseld 3921 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) → 𝑦 ∈ 𝐵)) |
| 11 | 10 | pm4.71rd 562 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (𝐹 “ 𝑋)))) |
| 12 | rabid 3411 | . . . 4 ⊢ (𝑦 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦} ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦)) | |
| 13 | 12 | a1i 11 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦} ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦))) |
| 14 | 7, 11, 13 | 3bitr4d 311 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) ↔ 𝑦 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦})) |
| 15 | 1, 2, 3, 14 | eqrd 3942 | 1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝐹 “ 𝑋) = {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∃wrex 3062 {crab 3390 ⊆ wss 3890 “ cima 5627 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 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 5231 ax-nul 5241 ax-pr 5370 |
| 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 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 |
| This theorem is referenced by: locfinreflem 34000 uspgrlimlem1 48476 uspgrlimlem2 48477 |
| Copyright terms: Public domain | W3C validator |