Theorem constmap 40535

Description: A constant (represented without dummy variables) is an element of a function set.

Note: In the following development, we will be quite often quantifying over functions and points in N-dimensional space (which are equivalent to functions from an "index set"). Many of the following theorems exist to transfer standard facts about functions to elements of function sets. (Contributed by Stefan O'Rear, 30-Aug-2014.) (Revised by Stefan O'Rear, 5-May-2015.)

Hypotheses

Ref	Expression
constmap.1	⊢ 𝐴 ∈ V
constmap.3	⊢ 𝐶 ∈ V

Assertion

Ref	Expression
constmap	⊢ (𝐵 ∈ 𝐶 → (𝐴 × {𝐵}) ∈ (𝐶 ↑m 𝐴))

Proof of Theorem constmap

Step	Hyp	Ref	Expression
1		fconst6g 6663	. 2 ⊢ (𝐵 ∈ 𝐶 → (𝐴 × {𝐵}):𝐴⟶𝐶)
2		constmap.3	. . 3 ⊢ 𝐶 ∈ V
3		constmap.1	. . 3 ⊢ 𝐴 ∈ V
4	2, 3	elmap 8659	. 2 ⊢ ((𝐴 × {𝐵}) ∈ (𝐶 ↑m 𝐴) ↔ (𝐴 × {𝐵}):𝐴⟶𝐶)
5	1, 4	sylibr 233	1 ⊢ (𝐵 ∈ 𝐶 → (𝐴 × {𝐵}) ∈ (𝐶 ↑m 𝐴))

Syntax hints:   → wi 4   ∈ wcel 2106  Vcvv 3432  {csn 4561   × cxp 5587  ⟶wf 6429  (class class class)co 7275   ↑_m cmap 8615

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-map 8617

This theorem is referenced by:  mzpclall  40549  mzpindd  40568