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

Theorem fnmpoovd 8081
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 3185 . . . 4 (𝜑 → ∀𝑎𝐴𝑏𝐵 𝐶𝑉)
5 eqid 2734 . . . . 5 (𝑎𝐴, 𝑏𝐵𝐶) = (𝑎𝐴, 𝑏𝐵𝐶)
65fnmpo 8063 . . . 4 (∀𝑎𝐴𝑏𝐵 𝐶𝑉 → (𝑎𝐴, 𝑏𝐵𝐶) Fn (𝐴 × 𝐵))
74, 6syl 17 . . 3 (𝜑 → (𝑎𝐴, 𝑏𝐵𝐶) Fn (𝐴 × 𝐵))
8 eqfnov2 7532 . . 3 ((𝑀 Fn (𝐴 × 𝐵) ∧ (𝑎𝐴, 𝑏𝐵𝐶) Fn (𝐴 × 𝐵)) → (𝑀 = (𝑎𝐴, 𝑏𝐵𝐶) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗)))
91, 7, 8syl2anc 584 . 2 (𝜑 → (𝑀 = (𝑎𝐴, 𝑏𝐵𝐶) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗)))
10 nfcv 2897 . . . . . . . 8 𝑎𝐷
11 nfcv 2897 . . . . . . . 8 𝑏𝐷
12 nfcv 2897 . . . . . . . 8 𝑖𝐶
13 nfcv 2897 . . . . . . . 8 𝑗𝐶
14 fnmpoovd.s . . . . . . . 8 ((𝑖 = 𝑎𝑗 = 𝑏) → 𝐷 = 𝐶)
1510, 11, 12, 13, 14cbvmpo 7496 . . . . . . 7 (𝑖𝐴, 𝑗𝐵𝐷) = (𝑎𝐴, 𝑏𝐵𝐶)
1615eqcomi 2743 . . . . . 6 (𝑎𝐴, 𝑏𝐵𝐶) = (𝑖𝐴, 𝑗𝐵𝐷)
1716a1i 11 . . . . 5 (𝜑 → (𝑎𝐴, 𝑏𝐵𝐶) = (𝑖𝐴, 𝑗𝐵𝐷))
1817oveqd 7417 . . . 4 (𝜑 → (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗))
1918eqeq2d 2745 . . 3 (𝜑 → ((𝑖𝑀𝑗) = (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗) ↔ (𝑖𝑀𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗)))
20192ralbidv 3203 . 2 (𝜑 → (∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑎𝐴, 𝑏𝐵𝐶)𝑗) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗)))
21 simprl 770 . . . . 5 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → 𝑖𝐴)
22 simprr 772 . . . . 5 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → 𝑗𝐵)
23 fnmpoovd.d . . . . . 6 ((𝜑𝑖𝐴𝑗𝐵) → 𝐷𝑈)
24233expb 1120 . . . . 5 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → 𝐷𝑈)
25 eqid 2734 . . . . . 6 (𝑖𝐴, 𝑗𝐵𝐷) = (𝑖𝐴, 𝑗𝐵𝐷)
2625ovmpt4g 7549 . . . . 5 ((𝑖𝐴𝑗𝐵𝐷𝑈) → (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗) = 𝐷)
2721, 22, 24, 26syl3anc 1372 . . . 4 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗) = 𝐷)
2827eqeq2d 2745 . . 3 ((𝜑 ∧ (𝑖𝐴𝑗𝐵)) → ((𝑖𝑀𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗) ↔ (𝑖𝑀𝑗) = 𝐷))
29282ralbidva 3201 . 2 (𝜑 → (∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = (𝑖(𝑖𝐴, 𝑗𝐵𝐷)𝑗) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = 𝐷))
309, 20, 293bitrd 305 1 (𝜑 → (𝑀 = (𝑎𝐴, 𝑏𝐵𝐶) ↔ ∀𝑖𝐴𝑗𝐵 (𝑖𝑀𝑗) = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1539  wcel 2107  wral 3050   × cxp 5650   Fn wfn 6523  (class class class)co 7400  cmpo 7402
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-sep 5264  ax-nul 5274  ax-pr 5400  ax-un 7724
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3414  df-v 3459  df-sbc 3764  df-csb 3873  df-dif 3927  df-un 3929  df-in 3931  df-ss 3941  df-nul 4307  df-if 4499  df-sn 4600  df-pr 4602  df-op 4606  df-uni 4882  df-iun 4967  df-br 5118  df-opab 5180  df-mpt 5200  df-id 5546  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6530  df-fn 6531  df-f 6532  df-fv 6536  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7983  df-2nd 7984
This theorem is referenced by:  mpofrlmd  21724  fedgmullem2  33605
  Copyright terms: Public domain W3C validator