Theorem fconst3 7193

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 7192	. 2 ⊢ (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵))
2		fnfun 6617	. . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
3		fndm 6620	. . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
4		eqimss2 3995	. . . . 5 ⊢ (dom 𝐹 = 𝐴 → 𝐴 ⊆ dom 𝐹)
5	3, 4	syl 17	. . . 4 ⊢ (𝐹 Fn 𝐴 → 𝐴 ⊆ dom 𝐹)
6		funconstss 7033	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
7	2, 5, 6	syl2anc 593	. . 3 ⊢ (𝐹 Fn 𝐴 → (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
8	7	pm5.32i 582	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵) ↔ (𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
9	1, 8	bitri 277	1 ⊢ (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))

Syntax hints:   ↔ wb 208   ∧ wa 399   = wceq 1559  ∀wral 3075   ⊆ wss 3904  {csn 4581  ^◡ccnv 5644  dom cdm 5645   “ cima 5648  Fun wfun 6511   Fn wfn 6512  ⟶wf 6513  ‘cfv 6517

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-fv 6525

This theorem is referenced by:  fconst4  7194  dnsconst  23418