| 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 1915 | . 2 ⊢ Ⅎ𝑦(𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) | |
| 2 | nfcv 2898 | . 2 ⊢ Ⅎ𝑦(𝐹 “ 𝑋) | |
| 3 | nfrab1 3419 | . 2 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦} | |
| 4 | ffn 6662 | . . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴) | |
| 5 | fvelimab 6906 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) ↔ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦)) | |
| 6 | 5 | anbi2d 630 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (𝐹 “ 𝑋)) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦))) |
| 7 | 4, 6 | sylan 580 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → ((𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (𝐹 “ 𝑋)) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦))) |
| 8 | fimass 6682 | . . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 “ 𝑋) ⊆ 𝐵) | |
| 9 | 8 | adantr 480 | . . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝐹 “ 𝑋) ⊆ 𝐵) |
| 10 | 9 | sseld 3932 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) → 𝑦 ∈ 𝐵)) |
| 11 | 10 | pm4.71rd 562 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ (𝐹 “ 𝑋)))) |
| 12 | rabid 3420 | . . . 4 ⊢ (𝑦 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦} ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦)) | |
| 13 | 12 | a1i 11 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦} ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦))) |
| 14 | 7, 11, 13 | 3bitr4d 311 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝑋) ↔ 𝑦 ∈ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦})) |
| 15 | 1, 2, 3, 14 | eqrd 3953 | 1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ⊆ 𝐴) → (𝐹 “ 𝑋) = {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = 𝑦}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∃wrex 3060 {crab 3399 ⊆ wss 3901 “ 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 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 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 33997 uspgrlimlem1 48230 uspgrlimlem2 48231 |
| Copyright terms: Public domain | W3C validator |