MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elimampo Structured version   Visualization version   GIF version

Theorem elimampo 7589
Description: Membership in the image of an operation. (Contributed by SN, 27-Apr-2025.)
Hypotheses
Ref Expression
rngop.1 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
elimampo.d (𝜑 → 𝐷 ∈ 𝑉)
elimampo.x (𝜑 → 𝑋 ⊆ 𝐴)
elimampo.y (𝜑 → 𝑌 ⊆ 𝐵)
Assertion
Ref Expression
elimampo (𝜑 → (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶))
Distinct variable groups:   𝑦,𝐴,𝑥   𝑥,𝐷,𝑦   𝜑,𝑥,𝑦   𝑥,𝐴   𝑥,𝐵,𝑦   𝑥,𝑋,𝑦   𝑥,𝑌,𝑦
Allowed substitution hints:   𝐶(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem elimampo
StepHypRef Expression
1 df-ima 5671 . . . 4 (𝐹 “ (𝑋 × 𝑌)) = ran (𝐹 ↾ (𝑋 × 𝑌))
21eleq2i 2856 . . 3 (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ 𝐷 ∈ ran (𝐹 ↾ (𝑋 × 𝑌)))
3 rngop.1 . . . . . . 7 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
43reseq1i 5982 . . . . . 6 (𝐹 ↾ (𝑋 × 𝑌)) = ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ↾ (𝑋 × 𝑌))
5 elimampo.x . . . . . . 7 (𝜑 → 𝑋 ⊆ 𝐴)
6 elimampo.y . . . . . . 7 (𝜑 → 𝑌 ⊆ 𝐵)
7 resmpo 7571 . . . . . . 7 ((𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐵) → ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ↾ (𝑋 × 𝑌)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶))
85, 6, 7syl2anc 596 . . . . . 6 (𝜑 → ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ↾ (𝑋 × 𝑌)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶))
94, 8eqtrid 2810 . . . . 5 (𝜑 → (𝐹 ↾ (𝑋 × 𝑌)) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶))
109rneqd 5932 . . . 4 (𝜑 → ran (𝐹 ↾ (𝑋 × 𝑌)) = ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶))
1110eleq2d 2850 . . 3 (𝜑 → (𝐷 ∈ ran (𝐹 ↾ (𝑋 × 𝑌)) ↔ 𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)))
122, 11bitrid 286 . 2 (𝜑 → (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ 𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)))
13 elimampo.d . . 3 (𝜑 → 𝐷 ∈ 𝑉)
14 eqid 2763 . . . 4 (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶)
1514elrnmpog 7587 . . 3 (𝐷 ∈ 𝑉 → (𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶))
1613, 15syl 18 . 2 (𝜑 → (𝐷 ∈ ran (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌 ↦ 𝐶) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶))
1712, 16bitrd 282 1 (𝜑 → (𝐷 ∈ (𝐹 “ (𝑋 × 𝑌)) ↔ ∃𝑥 ∈ 𝑋 ∃𝑦 ∈ 𝑌 𝐷 = 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900   × cxp 5656  ran crn 5659   ↾ cres 5660   “ cima 5661   ∈ cmpo 7453
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-oprab 7455  df-mpo 7456
This theorem is used by:  psdmul  22542  elrgspnlem2  33903
  Copyright terms: Public domain W3C validator