ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ovg GIF version

Theorem ovg 6161
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 6021 . . . . 5 (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2 ovg.5 . . . . . 6 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
32fveq1i 5640 . . . . 5 (𝐹‘⟨𝐴, 𝐵⟩) = ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩)
41, 3eqtri 2252 . . . 4 (𝐴𝐹𝐵) = ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩)
54eqeq1i 2239 . . 3 ((𝐴𝐹𝐵) = 𝐶 ↔ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶)
6 eqeq2 2241 . . . . . . . . . 10 (𝑐 = 𝐶 → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶))
7 opeq2 3863 . . . . . . . . . . 11 (𝑐 = 𝐶 → ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩)
87eleq1d 2300 . . . . . . . . . 10 (𝑐 = 𝐶 → (⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
96, 8bibi12d 235 . . . . . . . . 9 (𝑐 = 𝐶 → ((({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}) ↔ (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})))
109imbi2d 230 . . . . . . . 8 (𝑐 = 𝐶 → (((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})) ↔ ((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))))
11 ovg.4 . . . . . . . . . . . 12 ((𝜏 ∧ (𝑥𝑅𝑦𝑆)) → ∃!𝑧𝜑)
1211ex 115 . . . . . . . . . . 11 (𝜏 → ((𝑥𝑅𝑦𝑆) → ∃!𝑧𝜑))
1312alrimivv 1923 . . . . . . . . . 10 (𝜏 → ∀𝑥𝑦((𝑥𝑅𝑦𝑆) → ∃!𝑧𝜑))
14 fnoprabg 6122 . . . . . . . . . 10 (∀𝑥𝑦((𝑥𝑅𝑦𝑆) → ∃!𝑧𝜑) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)})
1513, 14syl 14 . . . . . . . . 9 (𝜏 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)})
16 eleq1 2294 . . . . . . . . . . . 12 (𝑥 = 𝐴 → (𝑥𝑅𝐴𝑅))
1716anbi1d 465 . . . . . . . . . . 11 (𝑥 = 𝐴 → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝑦𝑆)))
18 eleq1 2294 . . . . . . . . . . . 12 (𝑦 = 𝐵 → (𝑦𝑆𝐵𝑆))
1918anbi2d 464 . . . . . . . . . . 11 (𝑦 = 𝐵 → ((𝐴𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
2017, 19opelopabg 4362 . . . . . . . . . 10 ((𝐴𝑅𝐵𝑆) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)} ↔ (𝐴𝑅𝐵𝑆)))
2120ibir 177 . . . . . . . . 9 ((𝐴𝑅𝐵𝑆) → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)})
22 fnopfvb 5685 . . . . . . . . 9 (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)} ∧ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑅𝑦𝑆)}) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
2315, 21, 22syl2an 289 . . . . . . . 8 ((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝑐 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑐⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
2410, 23vtoclg 2864 . . . . . . 7 (𝐶𝐷 → ((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})))
2524com12 30 . . . . . 6 ((𝜏 ∧ (𝐴𝑅𝐵𝑆)) → (𝐶𝐷 → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})))
2625exp32 365 . . . . 5 (𝜏 → (𝐴𝑅 → (𝐵𝑆 → (𝐶𝐷 → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)})))))
27263imp2 1248 . . . 4 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}))
28 ovg.1 . . . . . . 7 (𝑥 = 𝐴 → (𝜑𝜓))
2917, 28anbi12d 473 . . . . . 6 (𝑥 = 𝐴 → (((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝐴𝑅𝑦𝑆) ∧ 𝜓)))
30 ovg.2 . . . . . . 7 (𝑦 = 𝐵 → (𝜓𝜒))
3119, 30anbi12d 473 . . . . . 6 (𝑦 = 𝐵 → (((𝐴𝑅𝑦𝑆) ∧ 𝜓) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜒)))
32 ovg.3 . . . . . . 7 (𝑧 = 𝐶 → (𝜒𝜃))
3332anbi2d 464 . . . . . 6 (𝑧 = 𝐶 → (((𝐴𝑅𝐵𝑆) ∧ 𝜒) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
3429, 31, 33eloprabg 6109 . . . . 5 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
3534adantl 277 . . . 4 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)} ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
3627, 35bitrd 188 . . 3 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → (({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
375, 36bitrid 192 . 2 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → ((𝐴𝐹𝐵) = 𝐶 ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
38 biidd 172 . . . . 5 ((𝐴𝑅𝐵𝑆) → (((𝐴𝑅𝐵𝑆) ∧ 𝜃) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜃)))
3938bianabs 615 . . . 4 ((𝐴𝑅𝐵𝑆) → (((𝐴𝑅𝐵𝑆) ∧ 𝜃) ↔ 𝜃))
40393adant3 1043 . . 3 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (((𝐴𝑅𝐵𝑆) ∧ 𝜃) ↔ 𝜃))
4140adantl 277 . 2 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → (((𝐴𝑅𝐵𝑆) ∧ 𝜃) ↔ 𝜃))
4237, 41bitrd 188 1 ((𝜏 ∧ (𝐴𝑅𝐵𝑆𝐶𝐷)) → ((𝐴𝐹𝐵) = 𝐶𝜃))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1004  wal 1395   = wceq 1397  ∃!weu 2079  wcel 2202  cop 3672  {copab 4149   Fn wfn 5321  cfv 5326  (class class class)co 6018  {coprab 6019
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-ov 6021  df-oprab 6022
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator