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

Theorem ovig 6183
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 1021 . 2 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (𝐴𝑅𝐵𝑆))
2 eleq1 2297 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑅𝐴𝑅))
3 eleq1 2297 . . . . . 6 (𝑦 = 𝐵 → (𝑦𝑆𝐵𝑆))
42, 3bi2anan9 610 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
543adant3 1044 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → ((𝑥𝑅𝑦𝑆) ↔ (𝐴𝑅𝐵𝑆)))
6 ovig.1 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝜑𝜓))
75, 6anbi12d 473 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝐴𝑅𝐵𝑆) ∧ 𝜓)))
8 ovig.2 . . . 4 ((𝑥𝑅𝑦𝑆) → ∃*𝑧𝜑)
9 moanimv 2158 . . . 4 (∃*𝑧((𝑥𝑅𝑦𝑆) ∧ 𝜑) ↔ ((𝑥𝑅𝑦𝑆) → ∃*𝑧𝜑))
108, 9mpbir 146 . . 3 ∃*𝑧((𝑥𝑅𝑦𝑆) ∧ 𝜑)
11 ovig.3 . . 3 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝑅𝑦𝑆) ∧ 𝜑)}
127, 10, 11ovigg 6182 . 2 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (((𝐴𝑅𝐵𝑆) ∧ 𝜓) → (𝐴𝐹𝐵) = 𝐶))
131, 12mpand 429 1 ((𝐴𝑅𝐵𝑆𝐶𝐷) → (𝜓 → (𝐴𝐹𝐵) = 𝐶))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1005   = wceq 1398  ∃*wmo 2083  wcel 2205  (class class class)co 6058  {coprab 6059
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-iota 5317  df-fun 5359  df-fv 5365  df-ov 6061  df-oprab 6062
This theorem is referenced by:  th3q  6887  addnnnq0  7780  mulnnnq0  7781  addsrpr  8076  mulsrpr  8077
  Copyright terms: Public domain W3C validator