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

Theorem ovig 6057
Description: The value of an operation class abstraction (weak version). (Unnecessary distinct variable restrictions were removed by David Abernethy, 19-Jun-2012.) (Contributed by NM, 14-Sep-1999.) (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 996 . 2 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (𝐴𝑅𝐵𝑆))
2 eleq1 2267 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑅𝐴𝑅))
3 eleq1 2267 . . . . . 6 (𝑦 = 𝐵 → (𝑦𝑆𝐵𝑆))
42, 3bi2anan9 606 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
543adant3 1019 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
6 ovig.1 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝜑𝜓))
75, 6anbi12d 473 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜓)))
8 ovig.2 . . . 4 ((𝑥𝑅𝑦𝑆) → ∃*𝑧𝜑)
9 moanimv 2128 . . . 4 (∃*𝑧((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝑥𝑅𝑦𝑆) → ∃*𝑧𝜑))
108, 9mpbir 146 . . 3 ∃*𝑧((𝑥𝑅𝑦𝑆) ∧ 𝜑)
11 ovig.3 . . 3 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
127, 10, 11ovigg 6056 . 2 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (((𝐴𝑅𝐵𝑆) ∧ 𝜓) → (𝐴𝐹𝐵) = 𝐶))
131, 12mpand 429 1 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (𝜓 → (𝐴𝐹𝐵) = 𝐶))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 980   = wceq 1372  ∃*wmo 2054  wcel 2175  (class class class)co 5934  {coprab 5935
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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-sbc 2998  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-id 4338  df-xp 4679  df-rel 4680  df-cnv 4681  df-co 4682  df-dm 4683  df-iota 5229  df-fun 5270  df-fv 5276  df-ov 5937  df-oprab 5938
This theorem is referenced by:  th3q  6717  addnnnq0  7544  mulnnnq0  7545  addsrpr  7840  mulsrpr  7841
  Copyright terms: Public domain W3C validator