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

Theorem ov2gf 6083
Description: The value of an operation class abstraction. A version of ovmpog 6093 using bound-variable hypotheses. (Contributed by NM, 17-Aug-2006.) (Revised by Mario Carneiro, 19-Dec-2013.)
Hypotheses
Ref Expression
ov2gf.a 𝑥𝐴
ov2gf.c 𝑦𝐴
ov2gf.d 𝑦𝐵
ov2gf.1 𝑥𝐺
ov2gf.2 𝑦𝑆
ov2gf.3 (𝑥 = 𝐴𝑅 = 𝐺)
ov2gf.4 (𝑦 = 𝐵𝐺 = 𝑆)
ov2gf.5 𝐹 = (𝑥𝐶, 𝑦𝐷𝑅)
Assertion
Ref Expression
ov2gf ((𝐴𝐶𝐵𝐷𝑆𝐻) → (𝐴𝐹𝐵) = 𝑆)
Distinct variable groups:   𝑥,𝑦,𝐶   𝑥,𝐷,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝑅(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝐺(𝑥,𝑦)   𝐻(𝑥,𝑦)

Proof of Theorem ov2gf
StepHypRef Expression
1 elex 2785 . . 3 (𝑆𝐻𝑆 ∈ V)
2 ov2gf.a . . . 4 𝑥𝐴
3 ov2gf.c . . . 4 𝑦𝐴
4 ov2gf.d . . . 4 𝑦𝐵
5 ov2gf.1 . . . . . 6 𝑥𝐺
65nfel1 2360 . . . . 5 𝑥 𝐺 ∈ V
7 ov2gf.5 . . . . . . . 8 𝐹 = (𝑥𝐶, 𝑦𝐷𝑅)
8 nfmpo1 6025 . . . . . . . 8 𝑥(𝑥𝐶, 𝑦𝐷𝑅)
97, 8nfcxfr 2346 . . . . . . 7 𝑥𝐹
10 nfcv 2349 . . . . . . 7 𝑥𝑦
112, 9, 10nfov 5987 . . . . . 6 𝑥(𝐴𝐹𝑦)
1211, 5nfeq 2357 . . . . 5 𝑥(𝐴𝐹𝑦) = 𝐺
136, 12nfim 1596 . . . 4 𝑥(𝐺 ∈ V → (𝐴𝐹𝑦) = 𝐺)
14 ov2gf.2 . . . . . 6 𝑦𝑆
1514nfel1 2360 . . . . 5 𝑦 𝑆 ∈ V
16 nfmpo2 6026 . . . . . . . 8 𝑦(𝑥𝐶, 𝑦𝐷𝑅)
177, 16nfcxfr 2346 . . . . . . 7 𝑦𝐹
183, 17, 4nfov 5987 . . . . . 6 𝑦(𝐴𝐹𝐵)
1918, 14nfeq 2357 . . . . 5 𝑦(𝐴𝐹𝐵) = 𝑆
2015, 19nfim 1596 . . . 4 𝑦(𝑆 ∈ V → (𝐴𝐹𝐵) = 𝑆)
21 ov2gf.3 . . . . . 6 (𝑥 = 𝐴𝑅 = 𝐺)
2221eleq1d 2275 . . . . 5 (𝑥 = 𝐴 → (𝑅 ∈ V ↔ 𝐺 ∈ V))
23 oveq1 5964 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦))
2423, 21eqeq12d 2221 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = 𝑅 ↔ (𝐴𝐹𝑦) = 𝐺))
2522, 24imbi12d 234 . . . 4 (𝑥 = 𝐴 → ((𝑅 ∈ V → (𝑥𝐹𝑦) = 𝑅) ↔ (𝐺 ∈ V → (𝐴𝐹𝑦) = 𝐺)))
26 ov2gf.4 . . . . . 6 (𝑦 = 𝐵𝐺 = 𝑆)
2726eleq1d 2275 . . . . 5 (𝑦 = 𝐵 → (𝐺 ∈ V ↔ 𝑆 ∈ V))
28 oveq2 5965 . . . . . 6 (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵))
2928, 26eqeq12d 2221 . . . . 5 (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = 𝐺 ↔ (𝐴𝐹𝐵) = 𝑆))
3027, 29imbi12d 234 . . . 4 (𝑦 = 𝐵 → ((𝐺 ∈ V → (𝐴𝐹𝑦) = 𝐺) ↔ (𝑆 ∈ V → (𝐴𝐹𝐵) = 𝑆)))
317ovmpt4g 6081 . . . . 5 ((𝑥𝐶𝑦𝐷𝑅 ∈ V) → (𝑥𝐹𝑦) = 𝑅)
32313expia 1208 . . . 4 ((𝑥𝐶𝑦𝐷) → (𝑅 ∈ V → (𝑥𝐹𝑦) = 𝑅))
332, 3, 4, 13, 20, 25, 30, 32vtocl2gaf 2842 . . 3 ((𝐴𝐶𝐵𝐷) → (𝑆 ∈ V → (𝐴𝐹𝐵) = 𝑆))
341, 33syl5 32 . 2 ((𝐴𝐶𝐵𝐷) → (𝑆𝐻 → (𝐴𝐹𝐵) = 𝑆))
35343impia 1203 1 ((𝐴𝐶𝐵𝐷𝑆𝐻) → (𝐴𝐹𝐵) = 𝑆)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 981   = wceq 1373  wcel 2177  wnfc 2336  Vcvv 2773  (class class class)co 5957  cmpo 5959
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-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2180  ax-ext 2188  ax-sep 4170  ax-pow 4226  ax-pr 4261  ax-setind 4593
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-v 2775  df-sbc 3003  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-br 4052  df-opab 4114  df-id 4348  df-xp 4689  df-rel 4690  df-cnv 4691  df-co 4692  df-dm 4693  df-iota 5241  df-fun 5282  df-fv 5288  df-ov 5960  df-oprab 5961  df-mpo 5962
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator