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

Theorem fconst2g 6946
Description: A constant function expressed as a Cartesian product. (Contributed by NM, 27-Nov-2007.)
Assertion
Ref Expression
fconst2g (𝐵𝐶 → (𝐹:𝐴⟶{𝐵} ↔ 𝐹 = (𝐴 × {𝐵})))

Proof of Theorem fconst2g
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fvconst 6907 . . . . . . 7 ((𝐹:𝐴⟶{𝐵} ∧ 𝑥𝐴) → (𝐹𝑥) = 𝐵)
21adantlr 714 . . . . . 6 (((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) ∧ 𝑥𝐴) → (𝐹𝑥) = 𝐵)
3 fvconst2g 6945 . . . . . . 7 ((𝐵𝐶𝑥𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵)
43adantll 713 . . . . . 6 (((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) ∧ 𝑥𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵)
52, 4eqtr4d 2839 . . . . 5 (((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) ∧ 𝑥𝐴) → (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥))
65ralrimiva 3152 . . . 4 ((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) → ∀𝑥𝐴 (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥))
7 ffn 6491 . . . . 5 (𝐹:𝐴⟶{𝐵} → 𝐹 Fn 𝐴)
8 fnconstg 6545 . . . . 5 (𝐵𝐶 → (𝐴 × {𝐵}) Fn 𝐴)
9 eqfnfv 6783 . . . . 5 ((𝐹 Fn 𝐴 ∧ (𝐴 × {𝐵}) Fn 𝐴) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥𝐴 (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥)))
107, 8, 9syl2an 598 . . . 4 ((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥𝐴 (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥)))
116, 10mpbird 260 . . 3 ((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) → 𝐹 = (𝐴 × {𝐵}))
1211expcom 417 . 2 (𝐵𝐶 → (𝐹:𝐴⟶{𝐵} → 𝐹 = (𝐴 × {𝐵})))
13 fconstg 6544 . . 3 (𝐵𝐶 → (𝐴 × {𝐵}):𝐴⟶{𝐵})
14 feq1 6472 . . 3 (𝐹 = (𝐴 × {𝐵}) → (𝐹:𝐴⟶{𝐵} ↔ (𝐴 × {𝐵}):𝐴⟶{𝐵}))
1513, 14syl5ibrcom 250 . 2 (𝐵𝐶 → (𝐹 = (𝐴 × {𝐵}) → 𝐹:𝐴⟶{𝐵}))
1612, 15impbid 215 1 (𝐵𝐶 → (𝐹:𝐴⟶{𝐵} ↔ 𝐹 = (𝐴 × {𝐵})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2112  wral 3109  {csn 4528   × cxp 5521   Fn wfn 6323  wf 6324  cfv 6328
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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-ral 3114  df-rex 3115  df-rab 3118  df-v 3446  df-sbc 3724  df-csb 3832  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5428  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-fv 6336
This theorem is referenced by:  fconst2  6948  fconst5  6949  snmapen  8577  repsdf2  14135  cnconst  21893  padct  30485  prv1n  32792  fconst7  41901
  Copyright terms: Public domain W3C validator