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

Theorem fconst2g 7191
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 7150 . . . . . . 7 ((𝐹:𝐴⟶{𝐵} ∧ 𝑥𝐴) → (𝐹𝑥) = 𝐵)
21adantlr 727 . . . . . 6 (((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) ∧ 𝑥𝐴) → (𝐹𝑥) = 𝐵)
3 fvconst2g 7190 . . . . . . 7 ((𝐵𝐶𝑥𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵)
43adantll 726 . . . . . 6 (((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) ∧ 𝑥𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵)
52, 4eqtr4d 2803 . . . . 5 (((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) ∧ 𝑥𝐴) → (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥))
65ralrimiva 3157 . . . 4 ((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) → ∀𝑥𝐴 (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥))
7 ffn 6695 . . . . 5 (𝐹:𝐴⟶{𝐵} → 𝐹 Fn 𝐴)
8 fnconstg 6756 . . . . 5 (𝐵𝐶 → (𝐴 × {𝐵}) Fn 𝐴)
9 eqfnfv 7015 . . . . 5 ((𝐹 Fn 𝐴 ∧ (𝐴 × {𝐵}) Fn 𝐴) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥𝐴 (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥)))
107, 8, 9syl2an 607 . . . 4 ((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥𝐴 (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥)))
116, 10mpbird 260 . . 3 ((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) → 𝐹 = (𝐴 × {𝐵}))
1211expcom 418 . 2 (𝐵𝐶 → (𝐹:𝐴⟶{𝐵} → 𝐹 = (𝐴 × {𝐵})))
13 fconstg 6755 . . 3 (𝐵𝐶 → (𝐴 × {𝐵}):𝐴⟶{𝐵})
14 feq1 6673 . . 3 (𝐹 = (𝐴 × {𝐵}) → (𝐹:𝐴⟶{𝐵} ↔ (𝐴 × {𝐵}):𝐴⟶{𝐵}))
1513, 14syl5ibrcom 250 . 2 (𝐵𝐶 → (𝐹 = (𝐴 × {𝐵}) → 𝐹:𝐴⟶{𝐵}))
1612, 15impbid 215 1 (𝐵𝐶 → (𝐹:𝐴⟶{𝐵} ↔ 𝐹 = (𝐴 × {𝐵})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1563  wcel 2145  wral 3079  {csn 4585   × cxp 5650   Fn wfn 6520  wf 6521  cfv 6525
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  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 6527  df-fn 6528  df-f 6529  df-fv 6533
This theorem is referenced by:  fconst2  7193  fconst5  7194  snmapen  9023  repsdf2  14805  cnconst  23402  fconst7v  32877  padct  32975  prv1n  35794  fconst7  45837  eufsnlem  49470  mofsn  49473  mofeu  49477
  Copyright terms: Public domain W3C validator