Theorem fnres 5446

Description: An equivalence for functionality of a restriction. Compare dffun8 5352. (Contributed by Mario Carneiro, 20-May-2015.)

Assertion

Ref	Expression
fnres	⊢ ((𝐹 ↾ 𝐴) Fn 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦

Proof of Theorem fnres

Step	Hyp	Ref	Expression
1		ancom 266	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 ∃*𝑦 𝑥𝐹𝑦 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 𝑥𝐹𝑦) ↔ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑥𝐹𝑦 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 𝑥𝐹𝑦))
2		vex 2803	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
3	2	brres 5017	. . . . . . . . 9 ⊢ (𝑥(𝐹 ↾ 𝐴)𝑦 ↔ (𝑥𝐹𝑦 ∧ 𝑥 ∈ 𝐴))
4		ancom 266	. . . . . . . . 9 ⊢ ((𝑥𝐹𝑦 ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦))
5	3, 4	bitri 184	. . . . . . . 8 ⊢ (𝑥(𝐹 ↾ 𝐴)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦))
6	5	mobii 2114	. . . . . . 7 ⊢ (∃*𝑦 𝑥(𝐹 ↾ 𝐴)𝑦 ↔ ∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦))
7		moanimv 2153	. . . . . . 7 ⊢ (∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦) ↔ (𝑥 ∈ 𝐴 → ∃*𝑦 𝑥𝐹𝑦))
8	6, 7	bitri 184	. . . . . 6 ⊢ (∃*𝑦 𝑥(𝐹 ↾ 𝐴)𝑦 ↔ (𝑥 ∈ 𝐴 → ∃*𝑦 𝑥𝐹𝑦))
9	8	albii 1516	. . . . 5 ⊢ (∀𝑥∃*𝑦 𝑥(𝐹 ↾ 𝐴)𝑦 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦 𝑥𝐹𝑦))
10		relres 5039	. . . . . 6 ⊢ Rel (𝐹 ↾ 𝐴)
11		dffun6 5338	. . . . . 6 ⊢ (Fun (𝐹 ↾ 𝐴) ↔ (Rel (𝐹 ↾ 𝐴) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ 𝐴)𝑦))
12	10, 11	mpbiran 946	. . . . 5 ⊢ (Fun (𝐹 ↾ 𝐴) ↔ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ 𝐴)𝑦)
13		df-ral 2513	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∃*𝑦 𝑥𝐹𝑦 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦 𝑥𝐹𝑦))
14	9, 12, 13	3bitr4i 212	. . . 4 ⊢ (Fun (𝐹 ↾ 𝐴) ↔ ∀𝑥 ∈ 𝐴 ∃*𝑦 𝑥𝐹𝑦)
15		dmres 5032	. . . . . . 7 ⊢ dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹)
16		inss1 3425	. . . . . . 7 ⊢ (𝐴 ∩ dom 𝐹) ⊆ 𝐴
17	15, 16	eqsstri 3257	. . . . . 6 ⊢ dom (𝐹 ↾ 𝐴) ⊆ 𝐴
18		eqss 3240	. . . . . 6 ⊢ (dom (𝐹 ↾ 𝐴) = 𝐴 ↔ (dom (𝐹 ↾ 𝐴) ⊆ 𝐴 ∧ 𝐴 ⊆ dom (𝐹 ↾ 𝐴)))
19	17, 18	mpbiran 946	. . . . 5 ⊢ (dom (𝐹 ↾ 𝐴) = 𝐴 ↔ 𝐴 ⊆ dom (𝐹 ↾ 𝐴))
20		dfss3 3214	. . . . . 6 ⊢ (𝐴 ⊆ dom (𝐹 ↾ 𝐴) ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ dom (𝐹 ↾ 𝐴))
21	15	elin2 3393	. . . . . . . . 9 ⊢ (𝑥 ∈ dom (𝐹 ↾ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ dom 𝐹))
22	21	baib 924	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ dom (𝐹 ↾ 𝐴) ↔ 𝑥 ∈ dom 𝐹))
23		vex 2803	. . . . . . . . 9 ⊢ 𝑥 ∈ V
24	23	eldm 4926	. . . . . . . 8 ⊢ (𝑥 ∈ dom 𝐹 ↔ ∃𝑦 𝑥𝐹𝑦)
25	22, 24	bitrdi 196	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ dom (𝐹 ↾ 𝐴) ↔ ∃𝑦 𝑥𝐹𝑦))
26	25	ralbiia 2544	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ∈ dom (𝐹 ↾ 𝐴) ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 𝑥𝐹𝑦)
27	20, 26	bitri 184	. . . . 5 ⊢ (𝐴 ⊆ dom (𝐹 ↾ 𝐴) ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 𝑥𝐹𝑦)
28	19, 27	bitri 184	. . . 4 ⊢ (dom (𝐹 ↾ 𝐴) = 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 𝑥𝐹𝑦)
29	14, 28	anbi12i 460	. . 3 ⊢ ((Fun (𝐹 ↾ 𝐴) ∧ dom (𝐹 ↾ 𝐴) = 𝐴) ↔ (∀𝑥 ∈ 𝐴 ∃*𝑦 𝑥𝐹𝑦 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦 𝑥𝐹𝑦))
30		r19.26 2657	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦) ↔ (∀𝑥 ∈ 𝐴 ∃𝑦 𝑥𝐹𝑦 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 𝑥𝐹𝑦))
31	1, 29, 30	3bitr4i 212	. 2 ⊢ ((Fun (𝐹 ↾ 𝐴) ∧ dom (𝐹 ↾ 𝐴) = 𝐴) ↔ ∀𝑥 ∈ 𝐴 (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦))
32		df-fn 5327	. 2 ⊢ ((𝐹 ↾ 𝐴) Fn 𝐴 ↔ (Fun (𝐹 ↾ 𝐴) ∧ dom (𝐹 ↾ 𝐴) = 𝐴))
33		eu5 2125	. . 3 ⊢ (∃!𝑦 𝑥𝐹𝑦 ↔ (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦))
34	33	ralbii 2536	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦 ↔ ∀𝑥 ∈ 𝐴 (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦))
35	31, 32, 34	3bitr4i 212	1 ⊢ ((𝐹 ↾ 𝐴) Fn 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1393   = wceq 1395  ∃wex 1538  ∃!weu 2077  ∃*wmo 2078   ∈ wcel 2200  ∀wral 2508   ∩ cin 3197   ⊆ wss 3198   class class class wbr 4086  dom cdm 4723   ↾ cres 4725  Rel wrel 4728  Fun wfun 5318   Fn wfn 5319

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-res 4735  df-fun 5326  df-fn 5327

This theorem is referenced by:  f1ompt  5794