| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elimampo | Structured version Visualization version GIF version | ||
| Description: Membership in the image of an operation. (Contributed by SN, 27-Apr-2025.) |
| Ref | Expression |
|---|---|
| rngop.1 | ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
| elimampo.d | ⊢ (𝜑 → 𝐷 ∈ 𝑉) |
| elimampo.x | ⊢ (𝜑 → 𝑋 ⊆ 𝐴) |
| elimampo.y | ⊢ (𝜑 → 𝑌 ⊆ 𝐵) |
| Ref | Expression |
|---|---|
| elimampo | ⊢ (𝜑 → (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ima 5676 | . . . 4 ⊢ (𝐹 “ (𝑋 × 𝑌)) = ran (𝐹 ↾ (𝑋 × 𝑌)) | |
| 2 | 1 | eleq2i 2857 | . . 3 ⊢ (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ 𝐷 ∈ ran (𝐹 ↾ (𝑋 × 𝑌))) |
| 3 | rngop.1 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) | |
| 4 | 3 | reseq1i 5976 | . . . . . 6 ⊢ (𝐹 ↾ (𝑋 × 𝑌)) = ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ↾ (𝑋 × 𝑌)) |
| 5 | elimampo.x | . . . . . . 7 ⊢ (𝜑 → 𝑋 ⊆ 𝐴) | |
| 6 | elimampo.y | . . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ 𝐵) | |
| 7 | resmpo 7539 | . . . . . . 7 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐵) → ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ↾ (𝑋 × 𝑌)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)) | |
| 8 | 5, 6, 7 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ↾ (𝑋 × 𝑌)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)) |
| 9 | 4, 8 | eqtrid 2812 | . . . . 5 ⊢ (𝜑 → (𝐹 ↾ (𝑋 × 𝑌)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)) |
| 10 | 9 | rneqd 5930 | . . . 4 ⊢ (𝜑 → ran (𝐹 ↾ (𝑋 × 𝑌)) = ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)) |
| 11 | 10 | eleq2d 2851 | . . 3 ⊢ (𝜑 → (𝐷 ∈ ran (𝐹 ↾ (𝑋 × 𝑌)) ↔ 𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶))) |
| 12 | 2, 11 | bitrid 286 | . 2 ⊢ (𝜑 → (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ 𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶))) |
| 13 | elimampo.d | . . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑉) | |
| 14 | eqid 2765 | . . . 4 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) | |
| 15 | 14 | elrnmpog 7554 | . . 3 ⊢ (𝐷 ∈ 𝑉 → (𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶)) |
| 16 | 13, 15 | syl 18 | . 2 ⊢ (𝜑 → (𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶)) |
| 17 | 12, 16 | bitrd 282 | 1 ⊢ (𝜑 → (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 ⊆ wss 3906 × cxp 5661 ran crn 5664 ↾ cres 5665 “ cima 5666 ∈ cmpo 7421 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5112 df-opab 5176 df-xp 5669 df-rel 5670 df-cnv 5671 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-oprab 7423 df-mpo 7424 |
| This theorem is used by: psdmul 22379 elrgspnlem2 33627 |
| Copyright terms: Public domain | W3C validator |