![]() |
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 5702 | . . . 4 ⊢ (𝐹 “ (𝑋 × 𝑌)) = ran (𝐹 ↾ (𝑋 × 𝑌)) | |
2 | 1 | eleq2i 2831 | . . 3 ⊢ (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ 𝐷 ∈ ran (𝐹 ↾ (𝑋 × 𝑌))) |
3 | rngop.1 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) | |
4 | 3 | reseq1i 5996 | . . . . . 6 ⊢ (𝐹 ↾ (𝑋 × 𝑌)) = ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ↾ (𝑋 × 𝑌)) |
5 | elimampo.x | . . . . . . 7 ⊢ (𝜑 → 𝑋 ⊆ 𝐴) | |
6 | elimampo.y | . . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ 𝐵) | |
7 | resmpo 7553 | . . . . . . 7 ⊢ ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐵) → ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ↾ (𝑋 × 𝑌)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)) | |
8 | 5, 6, 7 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ↾ (𝑋 × 𝑌)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)) |
9 | 4, 8 | eqtrid 2787 | . . . . 5 ⊢ (𝜑 → (𝐹 ↾ (𝑋 × 𝑌)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)) |
10 | 9 | rneqd 5952 | . . . 4 ⊢ (𝜑 → ran (𝐹 ↾ (𝑋 × 𝑌)) = ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)) |
11 | 10 | eleq2d 2825 | . . 3 ⊢ (𝜑 → (𝐷 ∈ ran (𝐹 ↾ (𝑋 × 𝑌)) ↔ 𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶))) |
12 | 2, 11 | bitrid 283 | . 2 ⊢ (𝜑 → (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ 𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶))) |
13 | elimampo.d | . . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑉) | |
14 | eqid 2735 | . . . 4 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) | |
15 | 14 | elrnmpog 7568 | . . 3 ⊢ (𝐷 ∈ 𝑉 → (𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶)) |
16 | 13, 15 | syl 17 | . 2 ⊢ (𝜑 → (𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶)) |
17 | 12, 16 | bitrd 279 | 1 ⊢ (𝜑 → (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 = wceq 1537 ∈ wcel 2106 ∃wrex 3068 ⊆ wss 3963 × cxp 5687 ran crn 5690 ↾ cres 5691 “ cima 5692 ∈ cmpo 7433 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-br 5149 df-opab 5211 df-xp 5695 df-rel 5696 df-cnv 5697 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-oprab 7435 df-mpo 7436 |
This theorem is referenced by: psdmul 22188 elrgspnlem2 33233 |
Copyright terms: Public domain | W3C validator |