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

Theorem fconst2g 6960
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 6921 . . . . . . 7 ((𝐹:𝐴⟶{𝐵} ∧ 𝑥𝐴) → (𝐹𝑥) = 𝐵)
21adantlr 713 . . . . . 6 (((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) ∧ 𝑥𝐴) → (𝐹𝑥) = 𝐵)
3 fvconst2g 6959 . . . . . . 7 ((𝐵𝐶𝑥𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵)
43adantll 712 . . . . . 6 (((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) ∧ 𝑥𝐴) → ((𝐴 × {𝐵})‘𝑥) = 𝐵)
52, 4eqtr4d 2859 . . . . 5 (((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) ∧ 𝑥𝐴) → (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥))
65ralrimiva 3182 . . . 4 ((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) → ∀𝑥𝐴 (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥))
7 ffn 6509 . . . . 5 (𝐹:𝐴⟶{𝐵} → 𝐹 Fn 𝐴)
8 fnconstg 6562 . . . . 5 (𝐵𝐶 → (𝐴 × {𝐵}) Fn 𝐴)
9 eqfnfv 6797 . . . . 5 ((𝐹 Fn 𝐴 ∧ (𝐴 × {𝐵}) Fn 𝐴) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥𝐴 (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥)))
107, 8, 9syl2an 597 . . . 4 ((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) → (𝐹 = (𝐴 × {𝐵}) ↔ ∀𝑥𝐴 (𝐹𝑥) = ((𝐴 × {𝐵})‘𝑥)))
116, 10mpbird 259 . . 3 ((𝐹:𝐴⟶{𝐵} ∧ 𝐵𝐶) → 𝐹 = (𝐴 × {𝐵}))
1211expcom 416 . 2 (𝐵𝐶 → (𝐹:𝐴⟶{𝐵} → 𝐹 = (𝐴 × {𝐵})))
13 fconstg 6561 . . 3 (𝐵𝐶 → (𝐴 × {𝐵}):𝐴⟶{𝐵})
14 feq1 6490 . . 3 (𝐹 = (𝐴 × {𝐵}) → (𝐹:𝐴⟶{𝐵} ↔ (𝐴 × {𝐵}):𝐴⟶{𝐵}))
1513, 14syl5ibrcom 249 . 2 (𝐵𝐶 → (𝐹 = (𝐴 × {𝐵}) → 𝐹:𝐴⟶{𝐵}))
1612, 15impbid 214 1 (𝐵𝐶 → (𝐹:𝐴⟶{𝐵} ↔ 𝐹 = (𝐴 × {𝐵})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1533  wcel 2110  wral 3138  {csn 4561   × cxp 5548   Fn wfn 6345  wf 6346  cfv 6350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-fv 6358
This theorem is referenced by:  fconst2  6962  fconst5  6963  snmapen  8584  repsdf2  14134  cnconst  21886  padct  30449  prv1n  32673  fconst7  41531
  Copyright terms: Public domain W3C validator