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

Theorem ov 7395
Description: The value of an operation class abstraction. (Contributed by NM, 16-May-1995.) (Revised by David Abernethy, 19-Jun-2012.)
Hypotheses
Ref Expression
ov.1 𝐶 ∈ V
ov.2 (𝑥 = 𝐴 → (𝜑𝜓))
ov.3 (𝑦 = 𝐵 → (𝜓𝜒))
ov.4 (𝑧 = 𝐶 → (𝜒𝜃))
ov.5 ((𝑥𝑅𝑦𝑆) → ∃!𝑧𝜑)
ov.6 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
Assertion
Ref Expression
ov ((𝐴𝑅𝐵𝑆) → ((𝐴𝐹𝐵) = 𝐶𝜃))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝜃,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑥,𝑦,𝑧)   𝜒(𝑥,𝑦,𝑧)   𝐹(𝑥,𝑦,𝑧)

Proof of Theorem ov
StepHypRef Expression
1 df-ov 7258 . . . . 5 (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2 ov.6 . . . . . 6 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
32fveq1i 6757 . . . . 5 (𝐹‘⟨𝐴, 𝐵⟩) = ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩)
41, 3eqtri 2766 . . . 4 (𝐴𝐹𝐵) = ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩)
54eqeq1i 2743 . . 3 ((𝐴𝐹𝐵) = 𝐶 ↔ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶)
6 ov.5 . . . . . 6 ((𝑥𝑅𝑦𝑆) → ∃!𝑧𝜑)
76fnoprab 7378 . . . . 5 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)}
8 eleq1 2826 . . . . . . . 8 (𝑥 = 𝐴 → (𝑥𝑅𝐴𝑅))
98anbi1d 629 . . . . . . 7 (𝑥 = 𝐴 → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝑦𝑆)))
10 eleq1 2826 . . . . . . . 8 (𝑦 = 𝐵 → (𝑦𝑆𝐵𝑆))
1110anbi2d 628 . . . . . . 7 (𝑦 = 𝐵 → ((𝐴𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
129, 11opelopabg 5444 . . . . . 6 ((𝐴𝑅𝐵𝑆) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)} ↔ (𝐴𝑅𝐵𝑆)))
1312ibir 267 . . . . 5 ((𝐴𝑅𝐵𝑆) → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)})
14 fnopfvb 6805 . . . . 5 (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)} ∧ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)}) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
157, 13, 14sylancr 586 . . . 4 ((𝐴𝑅𝐵𝑆) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
16 ov.1 . . . . 5 𝐶 ∈ V
17 ov.2 . . . . . . 7 (𝑥 = 𝐴 → (𝜑𝜓))
189, 17anbi12d 630 . . . . . 6 (𝑥 = 𝐴 → (((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝐴𝑅𝑦𝑆) ∧ 𝜓)))
19 ov.3 . . . . . . 7 (𝑦 = 𝐵 → (𝜓𝜒))
2011, 19anbi12d 630 . . . . . 6 (𝑦 = 𝐵 → (((𝐴𝑅𝑦𝑆) ∧ 𝜓) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜒)))
21 ov.4 . . . . . . 7 (𝑧 = 𝐶 → (𝜒𝜃))
2221anbi2d 628 . . . . . 6 (𝑧 = 𝐶 → (((𝐴𝑅𝐵𝑆) ∧ 𝜒) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
2318, 20, 22eloprabg 7362 . . . . 5 ((𝐴𝑅𝐵𝑆𝐶 ∈ V) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
2416, 23mp3an3 1448 . . . 4 ((𝐴𝑅𝐵𝑆) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
2515, 24bitrd 278 . . 3 ((𝐴𝑅𝐵𝑆) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
265, 25syl5bb 282 . 2 ((𝐴𝑅𝐵𝑆) → ((𝐴𝐹𝐵) = 𝐶 ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
2726bianabs 541 1 ((𝐴𝑅𝐵𝑆) → ((𝐴𝐹𝐵) = 𝐶𝜃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  ∃!weu 2568  Vcvv 3422  cop 4564  {copab 5132   Fn wfn 6413  cfv 6418  (class class class)co 7255  {coprab 7256
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fn 6421  df-fv 6426  df-ov 7258  df-oprab 7259
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator