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

Theorem fnmpoovd 8019
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 1120 . . . . 5 ((𝜑 ∧ (𝑎𝐴𝑏𝐵)) → 𝐶𝑉)
43ralrimivva 3197 . . . 4 (𝜑 → ∀𝑎𝐴𝑏𝐵 𝐶𝑉)
5 eqid 2736 . . . . 5 (𝑎𝐴, 𝑏𝐵𝐶) = (𝑎𝐴, 𝑏𝐵𝐶)
65fnmpo 8001 . . . 4 (∀𝑎𝐴𝑏𝐵 𝐶𝑉 → (𝑎𝐴, 𝑏𝐵𝐶) Fn (𝐴 × 𝐵))
74, 6syl 17 . . 3 (𝜑 → (𝑎𝐴, 𝑏𝐵𝐶) Fn (𝐴 × 𝐵))
8 eqfnov2 7486 . . 3 ((𝑀 Fn (𝐴 × 𝐵) ∧ (𝑎𝐴, 𝑏𝐵𝐶) Fn (𝐴 × 𝐵)) → (𝑀 = (𝑎𝐴, 𝑏𝐵𝐶) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗)))
91, 7, 8syl2anc 584 . 2 (𝜑 → (𝑀 = (𝑎𝐴, 𝑏𝐵𝐶) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗)))
10 nfcv 2907 . . . . . . . 8 𝑎𝐷
11 nfcv 2907 . . . . . . . 8 𝑏𝐷
12 nfcv 2907 . . . . . . . 8 𝑖𝐶
13 nfcv 2907 . . . . . . . 8 𝑗𝐶
14 fnmpoovd.s . . . . . . . 8 ((𝑖 = 𝑎𝑗 = 𝑏) → 𝐷 = 𝐶)
1510, 11, 12, 13, 14cbvmpo 7451 . . . . . . 7 (𝑖𝐴, 𝑗𝐵𝐷) = (𝑎𝐴, 𝑏𝐵𝐶)
1615eqcomi 2745 . . . . . 6 (𝑎𝐴, 𝑏𝐵𝐶) = (𝑖𝐴, 𝑗𝐵𝐷)
1716a1i 11 . . . . 5 (𝜑 → (𝑎𝐴, 𝑏𝐵𝐶) = (𝑖𝐴, 𝑗𝐵𝐷))
1817oveqd 7374 . . . 4 (𝜑 → (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗))
1918eqeq2d 2747 . . 3 (𝜑 → ((𝑖𝑀𝑗) = (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗) ↔ (𝑖𝑀𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗)))
20192ralbidv 3212 . 2 (𝜑 → (∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗)))
21 simprl 769 . . . . 5 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → 𝑖𝐴)
22 simprr 771 . . . . 5 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → 𝑗𝐵)
23 fnmpoovd.d . . . . . 6 ((𝜑𝑖𝐴𝑗𝐵) → 𝐷𝑈)
24233expb 1120 . . . . 5 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → 𝐷𝑈)
25 eqid 2736 . . . . . 6 (𝑖𝐴, 𝑗𝐵𝐷) = (𝑖𝐴, 𝑗𝐵𝐷)
2625ovmpt4g 7502 . . . . 5 ((𝑖𝐴𝑗𝐵𝐷𝑈) → (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗) = 𝐷)
2721, 22, 24, 26syl3anc 1371 . . . 4 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗) = 𝐷)
2827eqeq2d 2747 . . 3 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → ((𝑖𝑀𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗) ↔ (𝑖𝑀𝑗) = 𝐷))
29282ralbidva 3210 . 2 (𝜑 → (∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = 𝐷))
309, 20, 293bitrd 304 1 (𝜑 → (𝑀 = (𝑎𝐴, 𝑏𝐵𝐶) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wral 3064   × cxp 5631   Fn wfn 6491  (class class class)co 7357  cmpo 7359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-1st 7921  df-2nd 7922
This theorem is referenced by:  mpofrlmd  21183  fedgmullem2  32325
  Copyright terms: Public domain W3C validator