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

Theorem ovmpodv2 7579
Description: Alternate deduction version of ovmpo 7581, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.)
Hypotheses
Ref Expression
ovmpodv2.1 (𝜑 → 𝐴 ∈ 𝐶)
ovmpodv2.2 ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝐷)
ovmpodv2.3 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 ∈ 𝑉)
ovmpodv2.4 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 = 𝑆)
Assertion
Ref Expression
ovmpodv2 (𝜑 → (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴𝐹𝐵) = 𝑆))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝜑,𝑥,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐶(𝑥, 𝑦)   𝐷(𝑥, 𝑦)   𝑅(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem ovmpodv2
StepHypRef Expression
1 eqidd 2761 . . 3 (𝜑 → (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅))
2 ovmpodv2.1 . . . 4 (𝜑 → 𝐴 ∈ 𝐶)
3 ovmpodv2.2 . . . 4 ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝐷)
4 ovmpodv2.3 . . . 4 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 ∈ 𝑉)
5 ovmpodv2.4 . . . . . 6 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 = 𝑆)
65eqeq2d 2771 . . . . 5 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ((𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑅 ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
76biimpd 232 . . . 4 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ((𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑅 → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
8 nfmpo1 7501 . . . 4 Ⅎ𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
9 nfcv 2922 . . . . . 6 Ⅎ𝑥𝐴
10 nfcv 2922 . . . . . 6 Ⅎ𝑥𝐵
119, 8, 10nfov 7451 . . . . 5 Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵)
1211nfeq1 2937 . . . 4 Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆
13 nfmpo2 7502 . . . 4 Ⅎ𝑦(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
14 nfcv 2922 . . . . . 6 Ⅎ𝑦𝐴
15 nfcv 2922 . . . . . 6 Ⅎ𝑦𝐵
1614, 13, 15nfov 7451 . . . . 5 Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵)
1716nfeq1 2937 . . . 4 Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆
182, 3, 4, 7, 8, 12, 13, 17ovmpodf 7577 . . 3 (𝜑 → ((𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
191, 18mpd 16 . 2 (𝜑 → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)
20 oveq 7427 . . 3 (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴𝐹𝐵) = (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵))
2120eqeq1d 2762 . 2 (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → ((𝐴𝐹𝐵) = 𝑆 ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
2219, 21syl5ibrcom 250 1 (𝜑 → (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴𝐹𝐵) = 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  (class class class)co 7421   ∈ cmpo 7423
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426
This theorem is used by:  coaval  18249  xpcco  18363  marrepval  22883  marrepeval  22884  marepveval  22889  submaval  22902  submaeval  22903  minmar1val  22969  minmar1eval  22970  plngval  29261  nbgrval  29923  clnbgrval  49014
  Copyright terms: Public domain W3C validator