Theorem fvmpopr2d 7575

Description: Value of an operation given by maps-to notation. (Contributed by Rohan Ridenour, 14-May-2024.)

Hypotheses

Ref	Expression
fvmpopr2d.1	⊢ (𝜑 → 𝐹 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶))
fvmpopr2d.2	⊢ (𝜑 → 𝑃 = ⟨𝑎, 𝑏⟩)
fvmpopr2d.3	⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → 𝐶 ∈ 𝑉)

Assertion

Ref	Expression
fvmpopr2d	⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝐹‘𝑃) = 𝐶)

Distinct variable groups:   𝐴,𝑎,𝑏   𝐵,𝑎,𝑏

Allowed substitution hints:   𝜑(𝑎, 𝑏)   𝐶(𝑎, 𝑏)   𝑃(𝑎, 𝑏)   𝐹(𝑎, 𝑏)   𝑉(𝑎, 𝑏)

Proof of Theorem fvmpopr2d

Dummy variables 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ov 7416	. . 3 ⊢ (𝑎(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑏) = ((𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)‘⟨𝑎, 𝑏⟩)
2		fvmpopr2d.1	. . . . 5 ⊢ (𝜑 → 𝐹 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶))
3	2	3ad2ant1 1151	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → 𝐹 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶))
4		fvmpopr2d.2	. . . . 5 ⊢ (𝜑 → 𝑃 = ⟨𝑎, 𝑏⟩)
5	4	3ad2ant1 1151	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → 𝑃 = ⟨𝑎, 𝑏⟩)
6	3, 5	fveq12d 6885	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝐹‘𝑃) = ((𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)‘⟨𝑎, 𝑏⟩))
7	1, 6	eqtr4id 2814	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝑎(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑏) = (𝐹‘𝑃))
8		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑐𝐶
9		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑑𝐶
10		nfcv 2922	. . . . . 6 ⊢ Ⅎ𝑎𝑑
11		nfcsb1v 3871	. . . . . 6 ⊢ Ⅎ𝑎⦋𝑐 / 𝑎⦌𝐶
12	10, 11	nfcsbw 3873	. . . . 5 ⊢ Ⅎ𝑎⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶
13		nfcsb1v 3871	. . . . 5 ⊢ Ⅎ𝑏⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶
14		csbeq1a 3861	. . . . . 6 ⊢ (𝑎 = 𝑐 → 𝐶 = ⦋𝑐 / 𝑎⦌𝐶)
15		csbeq1a 3861	. . . . . 6 ⊢ (𝑏 = 𝑑 → ⦋𝑐 / 𝑎⦌𝐶 = ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶)
16	14, 15	sylan9eq 2815	. . . . 5 ⊢ ((𝑎 = 𝑐 ∧ 𝑏 = 𝑑) → 𝐶 = ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶)
17	8, 9, 12, 13, 16	cbvmpo 7507	. . . 4 ⊢ (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) = (𝑐 ∈ 𝐴, 𝑑 ∈ 𝐵 ↦ ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶)
18	17	oveqi 7426	. . 3 ⊢ (𝑎(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑏) = (𝑎(𝑐 ∈ 𝐴, 𝑑 ∈ 𝐵 ↦ ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶)𝑏)
19		eqidd 2761	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝑐 ∈ 𝐴, 𝑑 ∈ 𝐵 ↦ ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶) = (𝑐 ∈ 𝐴, 𝑑 ∈ 𝐵 ↦ ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶))
20		equcom 2051	. . . . . . . 8 ⊢ (𝑎 = 𝑐 ↔ 𝑐 = 𝑎)
21		equcom 2051	. . . . . . . 8 ⊢ (𝑏 = 𝑑 ↔ 𝑑 = 𝑏)
22	20, 21	anbi12i 640	. . . . . . 7 ⊢ ((𝑎 = 𝑐 ∧ 𝑏 = 𝑑) ↔ (𝑐 = 𝑎 ∧ 𝑑 = 𝑏))
23	22, 16	sylbir 238	. . . . . 6 ⊢ ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) → 𝐶 = ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶)
24	23	eqcomd 2766	. . . . 5 ⊢ ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) → ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶 = 𝐶)
25	24	adantl 487	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝑐 = 𝑎 ∧ 𝑑 = 𝑏)) → ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶 = 𝐶)
26		simp2 1155	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → 𝑎 ∈ 𝐴)
27		simp3 1156	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ 𝐵)
28		fvmpopr2d.3	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → 𝐶 ∈ 𝑉)
29	19, 25, 26, 27, 28	ovmpod 7565	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝑎(𝑐 ∈ 𝐴, 𝑑 ∈ 𝐵 ↦ ⦋𝑑 / 𝑏⦌⦋𝑐 / 𝑎⦌𝐶)𝑏) = 𝐶)
30	18, 29	eqtrid 2807	. 2 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝑎(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑏) = 𝐶)
31	7, 30	eqtr3d 2797	1 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → (𝐹‘𝑃) = 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ⦋csb 3847  ⟨cop 4590  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415

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 2732  ax-sep 5251  ax-pr 5398

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418

This theorem is used by:  mpomulcn  25095  mnringmulrcld  45066