Theorem ov2gf 6213

Description: The value of an operation class abstraction. A version of ovmpog 6223 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

Step	Hyp	Ref	Expression
1		elex 2833	. . 3 ⊢ (𝑆 ∈ 𝐻 → 𝑆 ∈ V)
2		ov2gf.a	. . . 4 ⊢ Ⅎ𝑥𝐴
3		ov2gf.c	. . . 4 ⊢ Ⅎ𝑦𝐴
4		ov2gf.d	. . . 4 ⊢ Ⅎ𝑦𝐵
5		ov2gf.1	. . . . . 6 ⊢ Ⅎ𝑥𝐺
6	5	nfel1 2403	. . . . 5 ⊢ Ⅎ𝑥 𝐺 ∈ V
7		ov2gf.5	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
8		nfmpo1 6155	. . . . . . . 8 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
9	7, 8	nfcxfr 2389	. . . . . . 7 ⊢ Ⅎ𝑥𝐹
10		nfcv 2392	. . . . . . 7 ⊢ Ⅎ𝑥𝑦
11	2, 9, 10	nfov 6115	. . . . . 6 ⊢ Ⅎ𝑥(𝐴𝐹𝑦)
12	11, 5	nfeq 2400	. . . . 5 ⊢ Ⅎ𝑥(𝐴𝐹𝑦) = 𝐺
13	6, 12	nfim 1625	. . . 4 ⊢ Ⅎ𝑥(𝐺 ∈ V → (𝐴𝐹𝑦) = 𝐺)
14		ov2gf.2	. . . . . 6 ⊢ Ⅎ𝑦𝑆
15	14	nfel1 2403	. . . . 5 ⊢ Ⅎ𝑦 𝑆 ∈ V
16		nfmpo2 6156	. . . . . . . 8 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
17	7, 16	nfcxfr 2389	. . . . . . 7 ⊢ Ⅎ𝑦𝐹
18	3, 17, 4	nfov 6115	. . . . . 6 ⊢ Ⅎ𝑦(𝐴𝐹𝐵)
19	18, 14	nfeq 2400	. . . . 5 ⊢ Ⅎ𝑦(𝐴𝐹𝐵) = 𝑆
20	15, 19	nfim 1625	. . . 4 ⊢ Ⅎ𝑦(𝑆 ∈ V → (𝐴𝐹𝐵) = 𝑆)
21		ov2gf.3	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝑅 = 𝐺)
22	21	eleq1d 2307	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑅 ∈ V ↔ 𝐺 ∈ V))
23		oveq1 6092	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦))
24	23, 21	eqeq12d 2253	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦) = 𝑅 ↔ (𝐴𝐹𝑦) = 𝐺))
25	22, 24	imbi12d 234	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑅 ∈ V → (𝑥𝐹𝑦) = 𝑅) ↔ (𝐺 ∈ V → (𝐴𝐹𝑦) = 𝐺)))
26		ov2gf.4	. . . . . 6 ⊢ (𝑦 = 𝐵 → 𝐺 = 𝑆)
27	26	eleq1d 2307	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐺 ∈ V ↔ 𝑆 ∈ V))
28		oveq2 6093	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵))
29	28, 26	eqeq12d 2253	. . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦) = 𝐺 ↔ (𝐴𝐹𝐵) = 𝑆))
30	27, 29	imbi12d 234	. . . 4 ⊢ (𝑦 = 𝐵 → ((𝐺 ∈ V → (𝐴𝐹𝑦) = 𝐺) ↔ (𝑆 ∈ V → (𝐴𝐹𝐵) = 𝑆)))
31	7	ovmpt4g 6211	. . . . 5 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ V) → (𝑥𝐹𝑦) = 𝑅)
32	31	3expia 1236	. . . 4 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷) → (𝑅 ∈ V → (𝑥𝐹𝑦) = 𝑅))
33	2, 3, 4, 13, 20, 25, 30, 32	vtocl2gaf 2890	. . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝑆 ∈ V → (𝐴𝐹𝐵) = 𝑆))
34	1, 33	syl5 32	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝑆 ∈ 𝐻 → (𝐴𝐹𝐵) = 𝑆))
35	34	3impia 1231	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 𝑆 ∈ 𝐻) → (𝐴𝐹𝐵) = 𝑆)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  Ⅎwnfc 2379  Vcvv 2821  (class class class)co 6085   ∈ cmpo 6087

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090

This theorem is used by: (None)