Theorem ovmpordxf 49452

Description: Value of an operation given by a maps-to rule, deduction form, with substitution of second argument, analogous to ovmpodxf 7571. (Contributed by AV, 30-Mar-2019.)

Hypotheses

Ref	Expression
ovmpordx.1	⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅))
ovmpordx.2	⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 = 𝑆)
ovmpordx.3	⊢ ((𝜑 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐿)
ovmpordx.4	⊢ (𝜑 → 𝐴 ∈ 𝐿)
ovmpordx.5	⊢ (𝜑 → 𝐵 ∈ 𝐷)
ovmpordx.6	⊢ (𝜑 → 𝑆 ∈ 𝑋)
ovmpordxf.px	⊢ Ⅎ𝑥𝜑
ovmpordxf.py	⊢ Ⅎ𝑦𝜑
ovmpordxf.ay	⊢ Ⅎ𝑦𝐴
ovmpordxf.bx	⊢ Ⅎ𝑥𝐵
ovmpordxf.sx	⊢ Ⅎ𝑥𝑆
ovmpordxf.sy	⊢ Ⅎ𝑦𝑆

Assertion

Ref	Expression
ovmpordxf	⊢ (𝜑 → (𝐴𝐹𝐵) = 𝑆)

Distinct variable groups:   𝑥,𝑦   𝑥,𝐴   𝑦,𝐵

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑦)   𝐵(𝑥)   𝐶(𝑥, 𝑦)   𝐷(𝑥, 𝑦)   𝑅(𝑥, 𝑦)   𝑆(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝐿(𝑥, 𝑦)   𝑋(𝑥, 𝑦)

Proof of Theorem ovmpordxf

Step	Hyp	Ref	Expression
1		ovmpordx.1	. . 3 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅))
2	1	oveqd 7438	. 2 ⊢ (𝜑 → (𝐴𝐹𝐵) = (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵))
3		ovmpordx.4	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐿)
4		ovmpordxf.px	. . . . 5 ⊢ Ⅎ𝑥𝜑
5		ovmpordx.5	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝐷)
6		ovmpordxf.py	. . . . . . 7 ⊢ Ⅎ𝑦𝜑
7		eqid 2761	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
8	7	ovmpt4g 7568	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅)
9	8	a1i 11	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
10	6, 9	alrimi 2250	. . . . . 6 ⊢ (𝜑 → ∀𝑦((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
11	5, 10	spsbcd 3753	. . . . 5 ⊢ (𝜑 → [𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
12	4, 11	alrimi 2250	. . . 4 ⊢ (𝜑 → ∀𝑥[𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
13	3, 12	spsbcd 3753	. . 3 ⊢ (𝜑 → [𝐴 / 𝑥][𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
14	5	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝐷)
15	3	ad2antrr 739	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝐴 ∈ 𝐿)
16		simpr 490	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝑥 = 𝐴)
17	16	adantr 486	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑥 = 𝐴)
18		ovmpordx.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐿)
19	18	adantlr 728	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝐶 = 𝐿)
20	15, 17, 19	3eltr4d 2876	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑥 ∈ 𝐶)
21	5	ad2antrr 739	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝐵 ∈ 𝐷)
22		eleq1 2849	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝐷 ↔ 𝐵 ∈ 𝐷))
23	22	adantl 487	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → (𝑦 ∈ 𝐷 ↔ 𝐵 ∈ 𝐷))
24	21, 23	mpbird 260	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑦 ∈ 𝐷)
25		ovmpordx.2	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 = 𝑆)
26	25	anassrs 473	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑅 = 𝑆)
27		ovmpordx.6	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ 𝑋)
28	27	ad2antrr 739	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑆 ∈ 𝑋)
29	26, 28	eqeltrd 2861	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑅 ∈ 𝑋)
30		biimt 363	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → ((𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅 ↔ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅)))
31	20, 24, 29, 30	syl3anc 1398	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → ((𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅 ↔ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅)))
32		simpr 490	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
33	17, 32	oveq12d 7439	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵))
34	33, 26	eqeq12d 2777	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → ((𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅 ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
35	31, 34	bitr3d 284	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → (((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅) ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
36		ovmpordxf.ay	. . . . . . 7 ⊢ Ⅎ𝑦𝐴
37	36	nfeq2 2940	. . . . . 6 ⊢ Ⅎ𝑦 𝑥 = 𝐴
38	6, 37	nfan 1932	. . . . 5 ⊢ Ⅎ𝑦(𝜑 ∧ 𝑥 = 𝐴)
39		nfmpo2 7502	. . . . . . . 8 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
40		nfcv 2923	. . . . . . . 8 ⊢ Ⅎ𝑦𝐵
41	36, 39, 40	nfov 7451	. . . . . . 7 ⊢ Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵)
42		ovmpordxf.sy	. . . . . . 7 ⊢ Ⅎ𝑦𝑆
43	41, 42	nfeq 2936	. . . . . 6 ⊢ Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆
44	43	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)
45	14, 35, 38, 44	sbciedf 3781	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ([𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅) ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
46		nfcv 2923	. . . . . . 7 ⊢ Ⅎ𝑥𝐴
47		nfmpo1 7501	. . . . . . 7 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
48		ovmpordxf.bx	. . . . . . 7 ⊢ Ⅎ𝑥𝐵
49	46, 47, 48	nfov 7451	. . . . . 6 ⊢ Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵)
50		ovmpordxf.sx	. . . . . 6 ⊢ Ⅎ𝑥𝑆
51	49, 50	nfeq 2936	. . . . 5 ⊢ Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆
52	51	a1i 11	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)
53	3, 45, 4, 52	sbciedf 3781	. . 3 ⊢ (𝜑 → ([𝐴 / 𝑥][𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅) ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
54	13, 53	mpbid 235	. 2 ⊢ (𝜑 → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)
55	2, 54	eqtrd 2796	1 ⊢ (𝜑 → (𝐴𝐹𝐵) = 𝑆)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2145  Ⅎwnfc 2908  [wsbc 3739  (class class class)co 7421   ∈ cmpo 7423

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3900  df-un 3902  df-in 3904  df-ss 3915  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6495  df-fun 6541  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426

This theorem is used by:  ovmpordx  49453