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

Theorem ov2gf 5903
 Description: The value of an operation class abstraction. A version of ovmpog 5913 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 2700 . . 3 (𝑆𝐻𝑆 ∈ V)
2 ov2gf.a . . . 4 𝑥𝐴
3 ov2gf.c . . . 4 𝑦𝐴
4 ov2gf.d . . . 4 𝑦𝐵
5 ov2gf.1 . . . . . 6 𝑥𝐺
65nfel1 2293 . . . . 5 𝑥 𝐺 ∈ V
7 ov2gf.5 . . . . . . . 8 𝐹 = (𝑥𝐶, 𝑦𝐷𝑅)
8 nfmpo1 5846 . . . . . . . 8 𝑥(𝑥𝐶, 𝑦𝐷𝑅)
97, 8nfcxfr 2279 . . . . . . 7 𝑥𝐹
10 nfcv 2282 . . . . . . 7 𝑥𝑦
112, 9, 10nfov 5809 . . . . . 6 𝑥(𝐴𝐹𝑦)
1211, 5nfeq 2290 . . . . 5 𝑥(𝐴𝐹𝑦) = 𝐺
136, 12nfim 1552 . . . 4 𝑥(𝐺 ∈ V → (𝐴𝐹𝑦) = 𝐺)
14 ov2gf.2 . . . . . 6 𝑦𝑆
1514nfel1 2293 . . . . 5 𝑦 𝑆 ∈ V
16 nfmpo2 5847 . . . . . . . 8 𝑦(𝑥𝐶, 𝑦𝐷𝑅)
177, 16nfcxfr 2279 . . . . . . 7 𝑦𝐹
183, 17, 4nfov 5809 . . . . . 6 𝑦(𝐴𝐹𝐵)
1918, 14nfeq 2290 . . . . 5 𝑦(𝐴𝐹𝐵) = 𝑆
2015, 19nfim 1552 . . . 4 𝑦(𝑆 ∈ V → (𝐴𝐹𝐵) = 𝑆)
21 ov2gf.3 . . . . . 6 (𝑥 = 𝐴𝑅 = 𝐺)
2221eleq1d 2209 . . . . 5 (𝑥 = 𝐴 → (𝑅 ∈ V ↔ 𝐺 ∈ V))
23 oveq1 5789 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦))
2423, 21eqeq12d 2155 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = 𝑅 ↔ (𝐴𝐹𝑦) = 𝐺))
2522, 24imbi12d 233 . . . 4 (𝑥 = 𝐴 → ((𝑅 ∈ V → (𝑥𝐹𝑦) = 𝑅) ↔ (𝐺 ∈ V → (𝐴𝐹𝑦) = 𝐺)))
26 ov2gf.4 . . . . . 6 (𝑦 = 𝐵𝐺 = 𝑆)
2726eleq1d 2209 . . . . 5 (𝑦 = 𝐵 → (𝐺 ∈ V ↔ 𝑆 ∈ V))
28 oveq2 5790 . . . . . 6 (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵))
2928, 26eqeq12d 2155 . . . . 5 (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = 𝐺 ↔ (𝐴𝐹𝐵) = 𝑆))
3027, 29imbi12d 233 . . . 4 (𝑦 = 𝐵 → ((𝐺 ∈ V → (𝐴𝐹𝑦) = 𝐺) ↔ (𝑆 ∈ V → (𝐴𝐹𝐵) = 𝑆)))
317ovmpt4g 5901 . . . . 5 ((𝑥𝐶𝑦𝐷𝑅 ∈ V) → (𝑥𝐹𝑦) = 𝑅)
32313expia 1184 . . . 4 ((𝑥𝐶𝑦𝐷) → (𝑅 ∈ V → (𝑥𝐹𝑦) = 𝑅))
332, 3, 4, 13, 20, 25, 30, 32vtocl2gaf 2756 . . 3 ((𝐴𝐶𝐵𝐷) → (𝑆 ∈ V → (𝐴𝐹𝐵) = 𝑆))
341, 33syl5 32 . 2 ((𝐴𝐶𝐵𝐷) → (𝑆𝐻 → (𝐴𝐹𝐵) = 𝑆))
35343impia 1179 1 ((𝐴𝐶𝐵𝐷𝑆𝐻) → (𝐴𝐹𝐵) = 𝑆)
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ∧ w3a 963   = wceq 1332   ∈ wcel 1481  Ⅎwnfc 2269  Vcvv 2689  (class class class)co 5782   ∈ cmpo 5784 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-setind 4460 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-iota 5096  df-fun 5133  df-fv 5139  df-ov 5785  df-oprab 5786  df-mpo 5787 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator