Theorem fconst3 7187

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 7186	. 2 ⊢ (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵))
2		fnfun 6618	. . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
3		fndm 6621	. . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
4		eqimss2 4006	. . . . 5 ⊢ (dom 𝐹 = 𝐴 → 𝐴 ⊆ dom 𝐹)
5	3, 4	syl 17	. . . 4 ⊢ (𝐹 Fn 𝐴 → 𝐴 ⊆ dom 𝐹)
6		funconstss 7028	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
7	2, 5, 6	syl2anc 584	. . 3 ⊢ (𝐹 Fn 𝐴 → (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
8	7	pm5.32i 574	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝐵) ↔ (𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
9	1, 8	bitri 275	1 ⊢ (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1540  ∀wral 3044   ⊆ wss 3914  {csn 4589  ^◡ccnv 5637  dom cdm 5638   “ cima 5641  Fun wfun 6505   Fn wfn 6506  ⟶wf 6507  ‘cfv 6511

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519

This theorem is referenced by:  fconst4  7188  dnsconst  23265