Theorem fullfunfnv 36690

Description: The full functional part of 𝐹 is a function over V. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)

Assertion

Ref	Expression
fullfunfnv	⊢ FullFun𝐹 Fn V

Proof of Theorem fullfunfnv

Step	Hyp	Ref	Expression
1		funpartfun 36687	. . . . 5 ⊢ Fun Funpart𝐹
2		funfn 6568	. . . . 5 ⊢ (Fun Funpart𝐹 ↔ Funpart𝐹 Fn dom Funpart𝐹)
3	1, 2	mpbi 233	. . . 4 ⊢ Funpart𝐹 Fn dom Funpart𝐹
4		0ex 5261	. . . . . 6 ⊢ ∅ ∈ V
5	4	fconst 6766	. . . . 5 ⊢ ((V ∖ dom Funpart𝐹) × {∅}):(V ∖ dom Funpart𝐹)⟶{∅}
6		ffn 6707	. . . . 5 ⊢ (((V ∖ dom Funpart𝐹) × {∅}):(V ∖ dom Funpart𝐹)⟶{∅} → ((V ∖ dom Funpart𝐹) × {∅}) Fn (V ∖ dom Funpart𝐹))
7	5, 6	ax-mp 5	. . . 4 ⊢ ((V ∖ dom Funpart𝐹) × {∅}) Fn (V ∖ dom Funpart𝐹)
8	3, 7	pm3.2i 476	. . 3 ⊢ (Funpart𝐹 Fn dom Funpart𝐹 ∧ ((V ∖ dom Funpart𝐹) × {∅}) Fn (V ∖ dom Funpart𝐹))
9		disjdif 4426	. . 3 ⊢ (dom Funpart𝐹 ∩ (V ∖ dom Funpart𝐹)) = ∅
10		fnun 6651	. . 3 ⊢ (((Funpart𝐹 Fn dom Funpart𝐹 ∧ ((V ∖ dom Funpart𝐹) × {∅}) Fn (V ∖ dom Funpart𝐹)) ∧ (dom Funpart𝐹 ∩ (V ∖ dom Funpart𝐹)) = ∅) → (Funpart𝐹 ∪ ((V ∖ dom Funpart𝐹) × {∅})) Fn (dom Funpart𝐹 ∪ (V ∖ dom Funpart𝐹)))
11	8, 9, 10	mp2an 705	. 2 ⊢ (Funpart𝐹 ∪ ((V ∖ dom Funpart𝐹) × {∅})) Fn (dom Funpart𝐹 ∪ (V ∖ dom Funpart𝐹))
12		df-fullfun 36617	. . . 4 ⊢ FullFun𝐹 = (Funpart𝐹 ∪ ((V ∖ dom Funpart𝐹) × {∅}))
13	12	fneq1i 6634	. . 3 ⊢ (FullFun𝐹 Fn V ↔ (Funpart𝐹 ∪ ((V ∖ dom Funpart𝐹) × {∅})) Fn V)
14		unvdif 4429	. . . . 5 ⊢ (dom Funpart𝐹 ∪ (V ∖ dom Funpart𝐹)) = V
15	14	eqcomi 2770	. . . 4 ⊢ V = (dom Funpart𝐹 ∪ (V ∖ dom Funpart𝐹))
16	15	fneq2i 6635	. . 3 ⊢ ((Funpart𝐹 ∪ ((V ∖ dom Funpart𝐹) × {∅})) Fn V ↔ (Funpart𝐹 ∪ ((V ∖ dom Funpart𝐹) × {∅})) Fn (dom Funpart𝐹 ∪ (V ∖ dom Funpart𝐹)))
17	13, 16	bitri 278	. 2 ⊢ (FullFun𝐹 Fn V ↔ (Funpart𝐹 ∪ ((V ∖ dom Funpart𝐹) × {∅})) Fn (dom Funpart𝐹 ∪ (V ∖ dom Funpart𝐹)))
18	11, 17	mpbir 234	1 ⊢ FullFun𝐹 Fn V

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  Vcvv 3451   ∖ cdif 3896   ∪ cun 3897   ∩ cin 3898  ∅c0 4279  {csn 4584   × cxp 5649  dom cdm 5651  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533  Funpartcfunpart 36591  FullFuncfullfn 36592

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-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-symdif 4199  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-eprel 5551  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-1st 7999  df-2nd 8000  df-txp 36596  df-singleton 36604  df-singles 36605  df-image 36606  df-funpart 36616  df-fullfun 36617

This theorem is used by:  brfullfun  36692