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

Theorem ovig 6044
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 2259 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑅𝐴𝑅))
3 eleq1 2259 . . . . . 6 (𝑦 = 𝐵 → (𝑦𝑆𝐵𝑆))
42, 3bi2anan9 606 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
543adant3 1019 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
6 ovig.1 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝜑𝜓))
75, 6anbi12d 473 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜓)))
8 ovig.2 . . . 4 ((𝑥𝑅𝑦𝑆) → ∃*𝑧𝜑)
9 moanimv 2120 . . . 4 (∃*𝑧((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝑥𝑅𝑦𝑆) → ∃*𝑧𝜑))
108, 9mpbir 146 . . 3 ∃*𝑧((𝑥𝑅𝑦𝑆) ∧ 𝜑)
11 ovig.3 . . 3 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
127, 10, 11ovigg 6043 . 2 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (((𝐴𝑅𝐵𝑆) ∧ 𝜓) → (𝐴𝐹𝐵) = 𝐶))
131, 12mpand 429 1 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (𝜓 → (𝐴𝐹𝐵) = 𝐶))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 980   = wceq 1364  ∃*wmo 2046  wcel 2167  (class class class)co 5922  {coprab 5923
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fv 5266  df-ov 5925  df-oprab 5926
This theorem is referenced by:  th3q  6699  addnnnq0  7516  mulnnnq0  7517  addsrpr  7812  mulsrpr  7813
  Copyright terms: Public domain W3C validator