Theorem ovmpordxf 44461

Description: Value of an operation given by a maps-to rule, deduction form, with substitution of second argument, analogous to ovmpodxf 7293. (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 7166	. 2 ⊢ (𝜑 → (𝐴𝐹𝐵) = (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵))
3		ovmpordx.4	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐿)
4		ovmpordxf.px	. . . . 5 ⊢ Ⅎ𝑥𝜑
5		ovmpordx.5	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝐷)
6		ovmpordxf.py	. . . . . . 7 ⊢ Ⅎ𝑦𝜑
7		eqid 2820	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
8	7	ovmpt4g 7290	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅)
9	8	a1i 11	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
10	6, 9	alrimi 2212	. . . . . 6 ⊢ (𝜑 → ∀𝑦((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
11	5, 10	spsbcd 3782	. . . . 5 ⊢ (𝜑 → [𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
12	4, 11	alrimi 2212	. . . 4 ⊢ (𝜑 → ∀𝑥[𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
13	3, 12	spsbcd 3782	. . 3 ⊢ (𝜑 → [𝐴 / 𝑥][𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅))
14	5	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝐷)
15	3	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝐴 ∈ 𝐿)
16		simpr 487	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝑥 = 𝐴)
17	16	adantr 483	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑥 = 𝐴)
18		ovmpordx.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐿)
19	18	adantlr 713	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝐶 = 𝐿)
20	15, 17, 19	3eltr4d 2927	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑥 ∈ 𝐶)
21	5	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝐵 ∈ 𝐷)
22		eleq1 2899	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝐷 ↔ 𝐵 ∈ 𝐷))
23	22	adantl 484	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → (𝑦 ∈ 𝐷 ↔ 𝐵 ∈ 𝐷))
24	21, 23	mpbird 259	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑦 ∈ 𝐷)
25		ovmpordx.2	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 = 𝑆)
26	25	anassrs 470	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑅 = 𝑆)
27		ovmpordx.6	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ 𝑋)
28	27	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑆 ∈ 𝑋)
29	26, 28	eqeltrd 2912	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑅 ∈ 𝑋)
30		biimt 363	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → ((𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅 ↔ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅)))
31	20, 24, 29, 30	syl3anc 1366	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → ((𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅 ↔ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅)))
32		simpr 487	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
33	17, 32	oveq12d 7167	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵))
34	33, 26	eqeq12d 2836	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → ((𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅 ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
35	31, 34	bitr3d 283	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → (((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅) ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
36		ovmpordxf.ay	. . . . . . 7 ⊢ Ⅎ𝑦𝐴
37	36	nfeq2 2994	. . . . . 6 ⊢ Ⅎ𝑦 𝑥 = 𝐴
38	6, 37	nfan 1899	. . . . 5 ⊢ Ⅎ𝑦(𝜑 ∧ 𝑥 = 𝐴)
39		nfmpo2 7228	. . . . . . . 8 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
40		nfcv 2976	. . . . . . . 8 ⊢ Ⅎ𝑦𝐵
41	36, 39, 40	nfov 7179	. . . . . . 7 ⊢ Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵)
42		ovmpordxf.sy	. . . . . . 7 ⊢ Ⅎ𝑦𝑆
43	41, 42	nfeq 2990	. . . . . 6 ⊢ Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆
44	43	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)
45	14, 35, 38, 44	sbciedf 3809	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ([𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅) ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
46		nfcv 2976	. . . . . . 7 ⊢ Ⅎ𝑥𝐴
47		nfmpo1 7227	. . . . . . 7 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)
48		ovmpordxf.bx	. . . . . . 7 ⊢ Ⅎ𝑥𝐵
49	46, 47, 48	nfov 7179	. . . . . 6 ⊢ Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵)
50		ovmpordxf.sx	. . . . . 6 ⊢ Ⅎ𝑥𝑆
51	49, 50	nfeq 2990	. . . . 5 ⊢ Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆
52	51	a1i 11	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)
53	3, 45, 4, 52	sbciedf 3809	. . 3 ⊢ (𝜑 → ([𝐴 / 𝑥][𝐵 / 𝑦]((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷 ∧ 𝑅 ∈ 𝑋) → (𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝑦) = 𝑅) ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆))
54	13, 53	mpbid 234	. 2 ⊢ (𝜑 → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)
55	2, 54	eqtrd 2855	1 ⊢ (𝜑 → (𝐴𝐹𝐵) = 𝑆)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1082   = wceq 1536  Ⅎwnf 1783   ∈ wcel 2113  Ⅎwnfc 2960  [wsbc 3768  (class class class)co 7149   ∈ cmpo 7151

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pr 5323

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-sbc 3769  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5060  df-opab 5122  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-iota 6307  df-fun 6350  df-fv 6356  df-ov 7152  df-oprab 7153  df-mpo 7154

This theorem is referenced by:  ovmpordx  44462