Theorem fdmrn 6739

Description: A different way to write 𝐹 is a function. (Contributed by Thierry Arnoux, 7-Dec-2016.)

Assertion

Ref	Expression
fdmrn	⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹)

Proof of Theorem fdmrn

Step	Hyp	Ref	Expression
1		ssid 3953	. . 3 ⊢ ran 𝐹 ⊆ ran 𝐹
2		df-f 6541	. . 3 ⊢ (𝐹:dom 𝐹⟶ran 𝐹 ↔ (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ ran 𝐹))
3	1, 2	mpbiran2 723	. 2 ⊢ (𝐹:dom 𝐹⟶ran 𝐹 ↔ 𝐹 Fn dom 𝐹)
4		eqid 2761	. . 3 ⊢ dom 𝐹 = dom 𝐹
5		df-fn 6540	. . 3 ⊢ (𝐹 Fn dom 𝐹 ↔ (Fun 𝐹 ∧ dom 𝐹 = dom 𝐹))
6	4, 5	mpbiran2 723	. 2 ⊢ (𝐹 Fn dom 𝐹 ↔ Fun 𝐹)
7	3, 6	bitr2i 279	1 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹)

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ⊆ wss 3899  dom cdm 5651  ran crn 5652  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2753  df-ss 3916  df-fn 6540  df-f 6541

This theorem is used by:  funcofd  6740  nvof1o  7286  lfuhgr  29719  usgrwwlks2on  30540  umgrwwlks2on  30541  rinvf1o  33217  smatrcl  34421  locfinref  34466  limccog  46601  funfocofob  48117  grimuhgr  48954  isuspgrim0lem  48960