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

Theorem ovg 7565
Description: The value of an operation class abstraction. (Contributed by Jeff Madsen, 10-Jun-2010.)
Hypotheses
Ref Expression
ovg.1 (𝑥 = 𝐴 → (𝜑𝜓))
ovg.2 (𝑦 = 𝐵 → (𝜓𝜒))
ovg.3 (𝑧 = 𝐶 → (𝜒𝜃))
ovg.4 ((𝜏 ∧ (𝑥𝑅𝑦𝑆)) → ∃!𝑧𝜑)
ovg.5 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
Assertion
Ref Expression
ovg ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → ((𝐴𝐹𝐵) = 𝐶𝜃))
Distinct variable groups:   𝜓,𝑥   𝜒,𝑥,𝑦   𝜃,𝑥,𝑦,𝑧   𝜏,𝑥,𝑦   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑦,𝑧)   𝜒(𝑧)   𝜏(𝑧)   𝐷(𝑥,𝑦,𝑧)   𝐹(𝑥,𝑦,𝑧)

Proof of Theorem ovg
Dummy variable 𝑐 is distinct from all other variables.
StepHypRef Expression
1 df-ov 7403 . . . . 5 (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2 ovg.5 . . . . . 6 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
32fveq1i 6872 . . . . 5 (𝐹‘⟨𝐴, 𝐵⟩) = ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩)
41, 3eqtri 2788 . . . 4 (𝐴𝐹𝐵) = ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩)
54eqeq1i 2770 . . 3 ((𝐴𝐹𝐵) = 𝐶 ↔ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶)
6 eqeq2 2777 . . . . . . . . . 10 (𝑐 = 𝐶 → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶))
7 opeq2 4835 . . . . . . . . . . 11 (𝑐 = 𝐶 → ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩)
87eleq1d 2850 . . . . . . . . . 10 (𝑐 = 𝐶 → (⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
96, 8bibi12d 348 . . . . . . . . 9 (𝑐 = 𝐶 → ((({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}) ↔ (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})))
109imbi2d 343 . . . . . . . 8 (𝑐 = 𝐶 → (((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})) ↔ ((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))))
11 ovg.4 . . . . . . . . . . . 12 ((𝜏 ∧ (𝑥𝑅𝑦𝑆)) → ∃!𝑧𝜑)
1211ex 417 . . . . . . . . . . 11 (𝜏 → ((𝑥𝑅𝑦𝑆) → ∃!𝑧𝜑))
1312alrimivv 1951 . . . . . . . . . 10 (𝜏 → ∀𝑥𝑦((𝑥𝑅𝑦𝑆) → ∃!𝑧𝜑))
14 fnoprabg 7523 . . . . . . . . . 10 (∀𝑥𝑦((𝑥𝑅𝑦𝑆) → ∃!𝑧𝜑) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)})
1513, 14syl 18 . . . . . . . . 9 (𝜏 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)})
16 eleq1 2853 . . . . . . . . . . . 12 (𝑥 = 𝐴 → (𝑥𝑅𝐴𝑅))
1716anbi1d 642 . . . . . . . . . . 11 (𝑥 = 𝐴 → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝑦𝑆)))
18 eleq1 2853 . . . . . . . . . . . 12 (𝑦 = 𝐵 → (𝑦𝑆𝐵𝑆))
1918anbi2d 641 . . . . . . . . . . 11 (𝑦 = 𝐵 → ((𝐴𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
2017, 19opelopabg 5514 . . . . . . . . . 10 ((𝐴𝑅𝐵𝑆) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)} ↔ (𝐴𝑅𝐵𝑆)))
2120ibir 271 . . . . . . . . 9 ((𝐴𝑅𝐵𝑆) → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)})
22 fnopfvb 6922 . . . . . . . . 9 (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)} ∧ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)}) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
2315, 21, 22syl2an 607 . . . . . . . 8 ((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
2410, 23vtoclg 3525 . . . . . . 7 (𝐶𝐷 → ((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})))
2524com12 33 . . . . . 6 ((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (𝐶𝐷 → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})))
2625exp32 425 . . . . 5 (𝜏 → (𝐴𝑅 → (𝐵𝑆 → (𝐶𝐷 → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})))))
27263imp2 1366 . . . 4 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
28 ovg.1 . . . . . . 7 (𝑥 = 𝐴 → (𝜑𝜓))
2917, 28anbi12d 643 . . . . . 6 (𝑥 = 𝐴 → (((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝐴𝑅𝑦𝑆) ∧ 𝜓)))
30 ovg.2 . . . . . . 7 (𝑦 = 𝐵 → (𝜓𝜒))
3119, 30anbi12d 643 . . . . . 6 (𝑦 = 𝐵 → (((𝐴𝑅𝑦𝑆) ∧ 𝜓) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜒)))
32 ovg.3 . . . . . . 7 (𝑧 = 𝐶 → (𝜒𝜃))
3332anbi2d 641 . . . . . 6 (𝑧 = 𝐶 → (((𝐴𝑅𝐵𝑆) ∧ 𝜒) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
3429, 31, 33eloprabg 7510 . . . . 5 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
3534adantl 486 . . . 4 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
3627, 35bitrd 282 . . 3 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
375, 36bitrid 286 . 2 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → ((𝐴𝐹𝐵) = 𝐶 ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
38 biidd 265 . . . . 5 ((𝐴𝑅𝐵𝑆) → (((𝐴𝑅𝐵𝑆) ∧ 𝜃) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
3938bianabs 550 . . . 4 ((𝐴𝑅𝐵𝑆) → (((𝐴𝑅𝐵𝑆) ∧ 𝜃) ↔ 𝜃))
40393adant3 1148 . . 3 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (((𝐴𝑅𝐵𝑆) ∧ 𝜃) ↔ 𝜃))
4140adantl 486 . 2 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → (((𝐴𝑅𝐵𝑆) ∧ 𝜃) ↔ 𝜃))
4237, 41bitrd 282 1 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → ((𝐴𝐹𝐵) = 𝐶𝜃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101  wal 1561   = wceq 1563  wcel 2145  ∃!weu 2598  cop 4591  {copab 5167   Fn wfn 6520  cfv 6525  (class class class)co 7400  {coprab 7401
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-iota 6481  df-fun 6527  df-fn 6528  df-fv 6533  df-ov 7403  df-oprab 7404
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator