Theorem fconst3 7211

Description: Two ways to express a constant function. (Contributed by NM, 15-Mar-2007.)

Assertion

Ref	Expression
fconst3	⊢ (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))

Proof of Theorem fconst3

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fconstfv 7210	. 2 ⊢ (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵))
2		fnfun 6646	. . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
3		fndm 6649	. . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
4		eqimss2 4040	. . . . 5 ⊢ (dom 𝐹 = 𝐴 → 𝐴 ⊆ dom 𝐹)
5	3, 4	syl 17	. . . 4 ⊢ (𝐹 Fn 𝐴 → 𝐴 ⊆ dom 𝐹)
6		funconstss 7054	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
7	2, 5, 6	syl2anc 584	. . 3 ⊢ (𝐹 Fn 𝐴 → (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
8	7	pm5.32i 575	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵) ↔ (𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
9	1, 8	bitri 274	1 ⊢ (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))

Syntax hints:   ↔ wb 205   ∧ wa 396   = wceq 1541  ∀wral 3061   ⊆ wss 3947  {csn 4627  ^◡ccnv 5674  dom cdm 5675   “ cima 5678  Fun wfun 6534   Fn wfn 6535  ⟶wf 6536  ‘cfv 6540

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548

This theorem is referenced by:  fconst4  7212  dnsconst  22873