MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnmpoovd Structured version   Visualization version   GIF version

Theorem fnmpoovd 8133
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
StepHypRef Expression
1 fnmpoovd.m . . 3 (𝜑 → 𝑀 Fn (𝐴 × 𝐵))
2 fnmpoovd.c . . . . . 6 ((𝜑 ∧ 𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) → 𝐶 ∈ 𝑉)
323expb 1138 . . . . 5 ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)) → 𝐶 ∈ 𝑉)
43ralrimivva 3209 . . . 4 (𝜑 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝐶 ∈ 𝑉)
5 eqid 2763 . . . . 5 (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)
65fnmpo 8115 . . . 4 (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝐶 ∈ 𝑉 → (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) Fn (𝐴 × 𝐵))
74, 6syl 18 . . 3 (𝜑 → (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) Fn (𝐴 × 𝐵))
8 eqfnov2 7581 . . 3 ((𝑀 Fn (𝐴 × 𝐵) ∧ (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) Fn (𝐴 × 𝐵)) → (𝑀 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗)))
91, 7, 8syl2anc 596 . 2 (𝜑 → (𝑀 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗)))
10 nfcv 2926 . . . . . . . 8 Ⅎ𝑎𝐷
11 nfcv 2926 . . . . . . . 8 Ⅎ𝑏𝐷
12 nfcv 2926 . . . . . . . 8 Ⅎ𝑖𝐶
13 nfcv 2926 . . . . . . . 8 Ⅎ𝑗𝐶
14 fnmpoovd.s . . . . . . . 8 ((𝑖 = 𝑎 ∧ 𝑗 = 𝑏) → 𝐷 = 𝐶)
1510, 11, 12, 13, 14cbvmpo 7545 . . . . . . 7 (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷) = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)
1615eqcomi 2772 . . . . . 6 (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) = (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)
1716a1i 11 . . . . 5 (𝜑 → (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) = (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷))
1817oveqd 7468 . . . 4 (𝜑 → (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗))
1918eqeq2d 2774 . . 3 (𝜑 → ((𝑖𝑀𝑗) = (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗) ↔ (𝑖𝑀𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗)))
20192ralbidv 3230 . 2 (𝜑 → (∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶)𝑗) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗)))
21 simprl 783 . . . . 5 ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → 𝑖 ∈ 𝐴)
22 simprr 785 . . . . 5 ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → 𝑗 ∈ 𝐵)
23 fnmpoovd.d . . . . . 6 ((𝜑 ∧ 𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵) → 𝐷 ∈ 𝑈)
24233expb 1138 . . . . 5 ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → 𝐷 ∈ 𝑈)
25 eqid 2763 . . . . . 6 (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷) = (𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)
2625ovmpt4g 7599 . . . . 5 ((𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵 ∧ 𝐷 ∈ 𝑈) → (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗) = 𝐷)
2721, 22, 24, 26syl3anc 1399 . . . 4 ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗) = 𝐷)
2827eqeq2d 2774 . . 3 ((𝜑 ∧ (𝑖 ∈ 𝐴 ∧ 𝑗 ∈ 𝐵)) → ((𝑖𝑀𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗) ↔ (𝑖𝑀𝑗) = 𝐷))
29282ralbidva 3228 . 2 (𝜑 → (∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = (𝑖(𝑖 ∈ 𝐴, 𝑗 ∈ 𝐵 ↦ 𝐷)𝑗) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = 𝐷))
309, 20, 293bitrd 308 1 (𝜑 → (𝑀 = (𝑎 ∈ 𝐴, 𝑏 ∈ 𝐵 ↦ 𝐶) ↔ ∀𝑖 ∈ 𝐴 ∀𝑗 ∈ 𝐵 (𝑖𝑀𝑗) = 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   × cxp 5656   Fn wfn 6561  (class class class)co 7451   ∈ cmpo 7453
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036
This theorem is used by:  mpofrlmd  22138  fedgmullem2  34373
  Copyright terms: Public domain W3C validator