Theorem fnmpoovd 6319

Description: A function with a Cartesian product as domain is a mapping with two arguments defined by its operation values. (Contributed by AV, 20-Feb-2019.) (Revised by AV, 3-Jul-2022.)

Hypotheses

Ref	Expression
fnmpoovd.m	⊢ (𝜑 → 𝑀 Fn (𝐴 × 𝐵))
fnmpoovd.s	⊢ ((𝑖 = 𝑎 ∧ 𝑗 = 𝑏) → 𝐷 = 𝐶)
fnmpoovd.d	⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵) → 𝐷 ∈ 𝑈)
fnmpoovd.c	⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → 𝐶 ∈ 𝑉)

Assertion

Ref	Expression
fnmpoovd	⊢ (𝜑 → (𝑀 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = 𝐷))

Distinct variable groups:   𝐴,𝑎,𝑏,𝑖,𝑗   𝐵,𝑎,𝑏,𝑖,𝑗   𝐶,𝑖,𝑗   𝐷,𝑎,𝑏   𝑖,𝑀,𝑗   𝜑,𝑎,𝑏,𝑖,𝑗

Allowed substitution hints:   𝐶(𝑎,𝑏)   𝐷(𝑖,𝑗)   𝑈(𝑖,𝑗,𝑎,𝑏)   𝑀(𝑎,𝑏)   𝑉(𝑖,𝑗,𝑎,𝑏)

Proof of Theorem fnmpoovd

Step	Hyp	Ref	Expression
1		fnmpoovd.m	. . 3 ⊢ (𝜑 → 𝑀 Fn (𝐴 × 𝐵))
2		fnmpoovd.c	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → 𝐶 ∈ 𝑉)
3	2	3expb 1207	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → 𝐶 ∈ 𝑉)
4	3	ralrimivva 2589	. . . 4 ⊢ (𝜑 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝐶 ∈ 𝑉)
5		eqid 2206	. . . . 5 ⊢ (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)
6	5	fnmpo 6306	. . . 4 ⊢ (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝐶 ∈ 𝑉 → (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) Fn (𝐴 × 𝐵))
7	4, 6	syl 14	. . 3 ⊢ (𝜑 → (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) Fn (𝐴 × 𝐵))
8		eqfnov2 6071	. . 3 ⊢ ((𝑀 Fn (𝐴 × 𝐵) ∧ (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) Fn (𝐴 × 𝐵)) → (𝑀 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗)))
9	1, 7, 8	syl2anc 411	. 2 ⊢ (𝜑 → (𝑀 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗)))
10		nfcv 2349	. . . . . . . 8 ⊢ Ⅎ𝑎𝐷
11		nfcv 2349	. . . . . . . 8 ⊢ Ⅎ𝑏𝐷
12		nfcv 2349	. . . . . . . 8 ⊢ Ⅎ𝑖𝐶
13		nfcv 2349	. . . . . . . 8 ⊢ Ⅎ𝑗𝐶
14		fnmpoovd.s	. . . . . . . 8 ⊢ ((𝑖 = 𝑎 ∧ 𝑗 = 𝑏) → 𝐷 = 𝐶)
15	10, 11, 12, 13, 14	cbvmpo 6042	. . . . . . 7 ⊢ (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)
16	15	eqcomi 2210	. . . . . 6 ⊢ (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) = (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)
17	16	a1i 9	. . . . 5 ⊢ (𝜑 → (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) = (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷))
18	17	oveqd 5979	. . . 4 ⊢ (𝜑 → (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗))
19	18	eqeq2d 2218	. . 3 ⊢ (𝜑 → ((𝑖𝑀𝑗) = (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗) ↔ (𝑖𝑀𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗)))
20	19	2ralbidv 2531	. 2 ⊢ (𝜑 → (∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗)))
21		simprl 529	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → 𝑖 ∈ 𝐴)
22		simprr 531	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → 𝑗 ∈ 𝐵)
23		fnmpoovd.d	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵) → 𝐷 ∈ 𝑈)
24	23	3expb 1207	. . . . 5 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → 𝐷 ∈ 𝑈)
25		eqid 2206	. . . . . 6 ⊢ (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷) = (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)
26	25	ovmpt4g 6086	. . . . 5 ⊢ ((𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵 ∧ 𝐷 ∈ 𝑈) → (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗) = 𝐷)
27	21, 22, 24, 26	syl3anc 1250	. . . 4 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗) = 𝐷)
28	27	eqeq2d 2218	. . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → ((𝑖𝑀𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗) ↔ (𝑖𝑀𝑗) = 𝐷))
29	28	2ralbidva 2529	. 2 ⊢ (𝜑 → (∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = 𝐷))
30	9, 20, 29	3bitrd 214	1 ⊢ (𝜑 → (𝑀 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = 𝐷))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 981   = wceq 1373   ∈ wcel 2177  ∀wral 2485   × cxp 4686   Fn wfn 5280  (class class class)co 5962   ∈ cmpo 5964

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4173  ax-pow 4229  ax-pr 4264  ax-un 4493  ax-setind 4598

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3860  df-iun 3938  df-br 4055  df-opab 4117  df-mpt 4118  df-id 4353  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-iota 5246  df-fun 5287  df-fn 5288  df-f 5289  df-fv 5293  df-ov 5965  df-oprab 5966  df-mpo 5967  df-1st 6244  df-2nd 6245

This theorem is referenced by: (None)