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

Theorem imaeqexov 7671
Description: Substitute an operation value into an existential quantifier over an image. (Contributed by Scott Fenton, 20-Jan-2025.)
Hypothesis
Ref Expression
imaeqexov.1 (𝑥 = (𝑦𝐹𝑧) → (𝜑𝜓))
Assertion
Ref Expression
imaeqexov ((𝐹 Fn 𝐴 ∧ (𝐵 × 𝐶) ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ (𝐵 × 𝐶))𝜑 ↔ ∃𝑦𝐵𝑧𝐶 𝜓))
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝜑,𝑦,𝑧   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦,𝑧)

Proof of Theorem imaeqexov
StepHypRef Expression
1 df-rex 3071 . 2 (∃𝑥 ∈ (𝐹 “ (𝐵 × 𝐶))𝜑 ↔ ∃𝑥(𝑥 ∈ (𝐹 “ (𝐵 × 𝐶)) ∧ 𝜑))
2 ovelimab 7611 . . . . . 6 ((𝐹 Fn 𝐴 ∧ (𝐵 × 𝐶) ⊆ 𝐴) → (𝑥 ∈ (𝐹 “ (𝐵 × 𝐶)) ↔ ∃𝑦𝐵𝑧𝐶 𝑥 = (𝑦𝐹𝑧)))
32anbi1d 631 . . . . 5 ((𝐹 Fn 𝐴 ∧ (𝐵 × 𝐶) ⊆ 𝐴) → ((𝑥 ∈ (𝐹 “ (𝐵 × 𝐶)) ∧ 𝜑) ↔ (∃𝑦𝐵𝑧𝐶 𝑥 = (𝑦𝐹𝑧) ∧ 𝜑)))
4 r19.41v 3189 . . . . . . 7 (∃𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ (∃𝑧𝐶 𝑥 = (𝑦𝐹𝑧) ∧ 𝜑))
54rexbii 3094 . . . . . 6 (∃𝑦𝐵𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ ∃𝑦𝐵 (∃𝑧𝐶 𝑥 = (𝑦𝐹𝑧) ∧ 𝜑))
6 r19.41v 3189 . . . . . 6 (∃𝑦𝐵 (∃𝑧𝐶 𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ (∃𝑦𝐵𝑧𝐶 𝑥 = (𝑦𝐹𝑧) ∧ 𝜑))
75, 6bitr2i 276 . . . . 5 ((∃𝑦𝐵𝑧𝐶 𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ ∃𝑦𝐵𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑))
83, 7bitrdi 287 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐵 × 𝐶) ⊆ 𝐴) → ((𝑥 ∈ (𝐹 “ (𝐵 × 𝐶)) ∧ 𝜑) ↔ ∃𝑦𝐵𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑)))
98exbidv 1921 . . 3 ((𝐹 Fn 𝐴 ∧ (𝐵 × 𝐶) ⊆ 𝐴) → (∃𝑥(𝑥 ∈ (𝐹 “ (𝐵 × 𝐶)) ∧ 𝜑) ↔ ∃𝑥𝑦𝐵𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑)))
10 rexcom4 3288 . . . 4 (∃𝑦𝐵𝑥𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ ∃𝑥𝑦𝐵𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑))
11 rexcom4 3288 . . . . . 6 (∃𝑧𝐶𝑥(𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ ∃𝑥𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑))
12 ovex 7464 . . . . . . . 8 (𝑦𝐹𝑧) ∈ V
13 imaeqexov.1 . . . . . . . 8 (𝑥 = (𝑦𝐹𝑧) → (𝜑𝜓))
1412, 13ceqsexv 3532 . . . . . . 7 (∃𝑥(𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ 𝜓)
1514rexbii 3094 . . . . . 6 (∃𝑧𝐶𝑥(𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ ∃𝑧𝐶 𝜓)
1611, 15bitr3i 277 . . . . 5 (∃𝑥𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ ∃𝑧𝐶 𝜓)
1716rexbii 3094 . . . 4 (∃𝑦𝐵𝑥𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ ∃𝑦𝐵𝑧𝐶 𝜓)
1810, 17bitr3i 277 . . 3 (∃𝑥𝑦𝐵𝑧𝐶 (𝑥 = (𝑦𝐹𝑧) ∧ 𝜑) ↔ ∃𝑦𝐵𝑧𝐶 𝜓)
199, 18bitrdi 287 . 2 ((𝐹 Fn 𝐴 ∧ (𝐵 × 𝐶) ⊆ 𝐴) → (∃𝑥(𝑥 ∈ (𝐹 “ (𝐵 × 𝐶)) ∧ 𝜑) ↔ ∃𝑦𝐵𝑧𝐶 𝜓))
201, 19bitrid 283 1 ((𝐹 Fn 𝐴 ∧ (𝐵 × 𝐶) ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ (𝐵 × 𝐶))𝜑 ↔ ∃𝑦𝐵𝑧𝐶 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wex 1779  wcel 2108  wrex 3070  wss 3951   × cxp 5683  cima 5688   Fn wfn 6556  (class class class)co 7431
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-fv 6569  df-ov 7434
This theorem is referenced by:  naddunif  8731
  Copyright terms: Public domain W3C validator