Theorem fconst4 6977

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

Assertion

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

Proof of Theorem fconst4

Step	Hyp	Ref	Expression
1		fconst3 6976	. 2 ⊢ (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
2		cnvimass 5949	. . . . . 6 ⊢ (◡𝐹 “ {𝐵}) ⊆ dom 𝐹
3		fndm 6455	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
4	2, 3	sseqtrid 4019	. . . . 5 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ {𝐵}) ⊆ 𝐴)
5	4	biantrurd 535	. . . 4 ⊢ (𝐹 Fn 𝐴 → (𝐴 ⊆ (◡𝐹 “ {𝐵}) ↔ ((◡𝐹 “ {𝐵}) ⊆ 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵}))))
6		eqss 3982	. . . 4 ⊢ ((◡𝐹 “ {𝐵}) = 𝐴 ↔ ((◡𝐹 “ {𝐵}) ⊆ 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})))
7	5, 6	syl6bbr 291	. . 3 ⊢ (𝐹 Fn 𝐴 → (𝐴 ⊆ (◡𝐹 “ {𝐵}) ↔ (◡𝐹 “ {𝐵}) = 𝐴))
8	7	pm5.32i 577	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ⊆ (◡𝐹 “ {𝐵})) ↔ (𝐹 Fn 𝐴 ∧ (◡𝐹 “ {𝐵}) = 𝐴))
9	1, 8	bitri 277	1 ⊢ (𝐹:𝐴⟶{𝐵} ↔ (𝐹 Fn 𝐴 ∧ (◡𝐹 “ {𝐵}) = 𝐴))

Syntax hints:   ↔ wb 208   ∧ wa 398   = wceq 1537   ⊆ wss 3936  {csn 4567  ^◡ccnv 5554  dom cdm 5555   “ cima 5558   Fn wfn 6350  ⟶wf 6351

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  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 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-fv 6363

This theorem is referenced by:  lkr0f  36245