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

Theorem ovig 7514
Description: The value of an operation class abstraction (weak version). (Contributed by NM, 14-Sep-1999.) Remove unnecessary distinct variable conditions. (Revised by David Abernethy, 19-Jun-2012.) (Revised by Mario Carneiro, 19-Dec-2013.)
Hypotheses
Ref Expression
ovig.1 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝜑𝜓))
ovig.2 ((𝑥𝑅𝑦𝑆) → ∃*𝑧𝜑)
ovig.3 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
Assertion
Ref Expression
ovig ((𝐴𝑅𝐵𝑆𝐶𝐷) → (𝜓 → (𝐴𝐹𝐵) = 𝐶))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝜓,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝐷(𝑥,𝑦,𝑧)   𝐹(𝑥,𝑦,𝑧)

Proof of Theorem ovig
StepHypRef Expression
1 3simpa 1149 . 2 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (𝐴𝑅𝐵𝑆))
2 eleq1 2825 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑅𝐴𝑅))
3 eleq1 2825 . . . . . 6 (𝑦 = 𝐵 → (𝑦𝑆𝐵𝑆))
42, 3bi2anan9 639 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
543adant3 1133 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
6 ovig.1 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝜑𝜓))
75, 6anbi12d 633 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜓)))
8 ovig.2 . . . 4 ((𝑥𝑅𝑦𝑆) → ∃*𝑧𝜑)
9 moanimv 2620 . . . 4 (∃*𝑧((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝑥𝑅𝑦𝑆) → ∃*𝑧𝜑))
108, 9mpbir 231 . . 3 ∃*𝑧((𝑥𝑅𝑦𝑆) ∧ 𝜑)
11 ovig.3 . . 3 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
127, 10, 11ovigg 7513 . 2 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (((𝐴𝑅𝐵𝑆) ∧ 𝜓) → (𝐴𝐹𝐵) = 𝐶))
131, 12mpand 696 1 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (𝜓 → (𝐴𝐹𝐵) = 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  ∃*wmo 2538  (class class class)co 7368  {coprab 7369
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-ov 7371  df-oprab 7372
This theorem is referenced by:  addsrpr  10998  mulsrpr  10999
  Copyright terms: Public domain W3C validator