Theorem fvn0ssdmfun 7057

Description: If a class' function values for certain arguments is not the empty set, the arguments are contained in the domain of the class, and the class restricted to the arguments is a function, analogous to fvfundmfvn0 6909. (Contributed by AV, 27-Jan-2020.) (Proof shortened by Peter Mazsa, 2-Oct-2022.)

Assertion

Ref	Expression
fvn0ssdmfun	⊢ (∀𝑎 ∈ 𝐷 (𝐹‘𝑎) ≠ ∅ → (𝐷 ⊆ dom 𝐹 ∧ Fun (𝐹 ↾ 𝐷)))

Distinct variable groups:   𝐷,𝑎   𝐹,𝑎

Proof of Theorem fvn0ssdmfun

Dummy variables 𝑝 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvfundmfvn0 6909	. . 3 ⊢ ((𝐹‘𝑎) ≠ ∅ → (𝑎 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝑎})))
2	1	ralimi 3101	. 2 ⊢ (∀𝑎 ∈ 𝐷 (𝐹‘𝑎) ≠ ∅ → ∀𝑎 ∈ 𝐷 (𝑎 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝑎})))
3		r19.26 3124	. . 3 ⊢ (∀𝑎 ∈ 𝐷 (𝑎 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝑎})) ↔ (∀𝑎 ∈ 𝐷 𝑎 ∈ dom 𝐹 ∧ ∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎})))
4		eleq1w 2847	. . . . . 6 ⊢ (𝑎 = 𝑝 → (𝑎 ∈ dom 𝐹 ↔ 𝑝 ∈ dom 𝐹))
5	4	rspccv 3580	. . . . 5 ⊢ (∀𝑎 ∈ 𝐷 𝑎 ∈ dom 𝐹 → (𝑝 ∈ 𝐷 → 𝑝 ∈ dom 𝐹))
6	5	ssrdv 3944	. . . 4 ⊢ (∀𝑎 ∈ 𝐷 𝑎 ∈ dom 𝐹 → 𝐷 ⊆ dom 𝐹)
7		funrel 6540	. . . . . . . 8 ⊢ (Fun (𝐹 ↾ {𝑎}) → Rel (𝐹 ↾ {𝑎}))
8	7	ralimi 3101	. . . . . . 7 ⊢ (∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎}) → ∀𝑎 ∈ 𝐷 Rel (𝐹 ↾ {𝑎}))
9		reliun 5791	. . . . . . 7 ⊢ (Rel ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) ↔ ∀𝑎 ∈ 𝐷 Rel (𝐹 ↾ {𝑎}))
10	8, 9	sylibr 236	. . . . . 6 ⊢ (∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎}) → Rel ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}))
11		sneq 4594	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑥 → {𝑎} = {𝑥})
12	11	reseq2d 5967	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → (𝐹 ↾ {𝑎}) = (𝐹 ↾ {𝑥}))
13	12	funeqd 6545	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → (Fun (𝐹 ↾ {𝑎}) ↔ Fun (𝐹 ↾ {𝑥})))
14	13	rspcva 3581	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐷 ∧ ∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎})) → Fun (𝐹 ↾ {𝑥}))
15		dffun5 6537	. . . . . . . . . . . 12 ⊢ (Fun (𝐹 ↾ {𝑥}) ↔ (Rel (𝐹 ↾ {𝑥}) ∧ ∀𝑤∃𝑦∀𝑧(⟨𝑤, 𝑧⟩ ∈ (𝐹 ↾ {𝑥}) → 𝑧 = 𝑦)))
16		vex 3460	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑥 ∈ V
17	16	elsnres 6009	. . . . . . . . . . . . . . . . 17 ⊢ (⟨𝑤, 𝑧⟩ ∈ (𝐹 ↾ {𝑥}) ↔ ∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹))
18	17	imbi1i 351	. . . . . . . . . . . . . . . 16 ⊢ ((⟨𝑤, 𝑧⟩ ∈ (𝐹 ↾ {𝑥}) → 𝑧 = 𝑦) ↔ (∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹) → 𝑧 = 𝑦))
19	18	albii 1841	. . . . . . . . . . . . . . 15 ⊢ (∀𝑧(⟨𝑤, 𝑧⟩ ∈ (𝐹 ↾ {𝑥}) → 𝑧 = 𝑦) ↔ ∀𝑧(∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹) → 𝑧 = 𝑦))
20	19	exbii 1870	. . . . . . . . . . . . . 14 ⊢ (∃𝑦∀𝑧(⟨𝑤, 𝑧⟩ ∈ (𝐹 ↾ {𝑥}) → 𝑧 = 𝑦) ↔ ∃𝑦∀𝑧(∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹) → 𝑧 = 𝑦))
21	20	albii 1841	. . . . . . . . . . . . 13 ⊢ (∀𝑤∃𝑦∀𝑧(⟨𝑤, 𝑧⟩ ∈ (𝐹 ↾ {𝑥}) → 𝑧 = 𝑦) ↔ ∀𝑤∃𝑦∀𝑧(∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹) → 𝑧 = 𝑦))
22		equcom 2040	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑎 = 𝑧 ↔ 𝑧 = 𝑎)
23		opeq12 4835	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑤 = 𝑥 ∧ 𝑧 = 𝑎) → ⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩)
24	23	ex 416	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑤 = 𝑥 → (𝑧 = 𝑎 → ⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩))
25	22, 24	biimtrid 244	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑤 = 𝑥 → (𝑎 = 𝑧 → ⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩))
26	25	adantr 484	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑤 = 𝑥 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → (𝑎 = 𝑧 → ⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩))
27	26	impcom 411	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑎 = 𝑧 ∧ (𝑤 = 𝑥 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹)) → ⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩)
28		opeq2 4834	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑧 = 𝑎 → ⟨𝑥, 𝑧⟩ = ⟨𝑥, 𝑎⟩)
29	28	equcoms 2042	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑎 = 𝑧 → ⟨𝑥, 𝑧⟩ = ⟨𝑥, 𝑎⟩)
30	29	eleq1d 2849	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑎 = 𝑧 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑎⟩ ∈ 𝐹))
31	30	biimpcd 251	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (⟨𝑥, 𝑧⟩ ∈ 𝐹 → (𝑎 = 𝑧 → ⟨𝑥, 𝑎⟩ ∈ 𝐹))
32	31	adantl 485	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑤 = 𝑥 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → (𝑎 = 𝑧 → ⟨𝑥, 𝑎⟩ ∈ 𝐹))
33	32	impcom 411	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑎 = 𝑧 ∧ (𝑤 = 𝑥 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹)) → ⟨𝑥, 𝑎⟩ ∈ 𝐹)
34	27, 33	jca 519	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑎 = 𝑧 ∧ (𝑤 = 𝑥 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹)) → (⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹))
35	34	ex 416	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝑧 → ((𝑤 = 𝑥 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → (⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹)))
36	35	spimevw 2007	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑤 = 𝑥 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → ∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹))
37	36	ex 416	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 = 𝑥 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → ∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹)))
38	37	imim1d 82	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = 𝑥 → ((∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹) → 𝑧 = 𝑦) → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
39	38	alimdv 1938	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = 𝑥 → (∀𝑧(∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹) → 𝑧 = 𝑦) → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
40	39	eximdv 1939	. . . . . . . . . . . . . 14 ⊢ (𝑤 = 𝑥 → (∃𝑦∀𝑧(∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹) → 𝑧 = 𝑦) → ∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
41	40	spimvw 2008	. . . . . . . . . . . . 13 ⊢ (∀𝑤∃𝑦∀𝑧(∃𝑎(⟨𝑤, 𝑧⟩ = ⟨𝑥, 𝑎⟩ ∧ ⟨𝑥, 𝑎⟩ ∈ 𝐹) → 𝑧 = 𝑦) → ∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦))
42	21, 41	sylbi 219	. . . . . . . . . . . 12 ⊢ (∀𝑤∃𝑦∀𝑧(⟨𝑤, 𝑧⟩ ∈ (𝐹 ↾ {𝑥}) → 𝑧 = 𝑦) → ∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦))
43	15, 42	simplbiim 512	. . . . . . . . . . 11 ⊢ (Fun (𝐹 ↾ {𝑥}) → ∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦))
44	14, 43	syl 17	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐷 ∧ ∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎})) → ∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦))
45	44	expcom 417	. . . . . . . . 9 ⊢ (∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎}) → (𝑥 ∈ 𝐷 → ∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
46		impexp 454	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦) ↔ (𝑥 ∈ 𝐷 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
47	46	albii 1841	. . . . . . . . . . 11 ⊢ (∀𝑧((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦) ↔ ∀𝑧(𝑥 ∈ 𝐷 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
48	47	exbii 1870	. . . . . . . . . 10 ⊢ (∃𝑦∀𝑧((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦) ↔ ∃𝑦∀𝑧(𝑥 ∈ 𝐷 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
49		19.21v 1961	. . . . . . . . . . 11 ⊢ (∀𝑧(𝑥 ∈ 𝐷 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)) ↔ (𝑥 ∈ 𝐷 → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
50	49	exbii 1870	. . . . . . . . . 10 ⊢ (∃𝑦∀𝑧(𝑥 ∈ 𝐷 → (⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)) ↔ ∃𝑦(𝑥 ∈ 𝐷 → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
51		19.37v 2019	. . . . . . . . . 10 ⊢ (∃𝑦(𝑥 ∈ 𝐷 → ∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)) ↔ (𝑥 ∈ 𝐷 → ∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
52	48, 50, 51	3bitri 299	. . . . . . . . 9 ⊢ (∃𝑦∀𝑧((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦) ↔ (𝑥 ∈ 𝐷 → ∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ 𝐹 → 𝑧 = 𝑦)))
53	45, 52	sylibr 236	. . . . . . . 8 ⊢ (∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎}) → ∃𝑦∀𝑧((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦))
54	53	alrimiv 1949	. . . . . . 7 ⊢ (∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎}) → ∀𝑥∃𝑦∀𝑧((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦))
55		resiun2 5988	. . . . . . . . . . . . . 14 ⊢ (𝐹 ↾ ∪ 𝑎 ∈ 𝐷 {𝑎}) = ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎})
56	55	eqcomi 2773	. . . . . . . . . . . . 13 ⊢ ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) = (𝐹 ↾ ∪ 𝑎 ∈ 𝐷 {𝑎})
57	56	eleq2i 2856	. . . . . . . . . . . 12 ⊢ (⟨𝑥, 𝑧⟩ ∈ ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) ↔ ⟨𝑥, 𝑧⟩ ∈ (𝐹 ↾ ∪ 𝑎 ∈ 𝐷 {𝑎}))
58		iunid 5020	. . . . . . . . . . . . . 14 ⊢ ∪ 𝑎 ∈ 𝐷 {𝑎} = 𝐷
59	58	reseq2i 5964	. . . . . . . . . . . . 13 ⊢ (𝐹 ↾ ∪ 𝑎 ∈ 𝐷 {𝑎}) = (𝐹 ↾ 𝐷)
60	59	eleq2i 2856	. . . . . . . . . . . 12 ⊢ (⟨𝑥, 𝑧⟩ ∈ (𝐹 ↾ ∪ 𝑎 ∈ 𝐷 {𝑎}) ↔ ⟨𝑥, 𝑧⟩ ∈ (𝐹 ↾ 𝐷))
61		vex 3460	. . . . . . . . . . . . 13 ⊢ 𝑧 ∈ V
62	61	opelresi 5975	. . . . . . . . . . . 12 ⊢ (⟨𝑥, 𝑧⟩ ∈ (𝐹 ↾ 𝐷) ↔ (𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹))
63	57, 60, 62	3bitri 299	. . . . . . . . . . 11 ⊢ (⟨𝑥, 𝑧⟩ ∈ ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) ↔ (𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹))
64	63	imbi1i 351	. . . . . . . . . 10 ⊢ ((⟨𝑥, 𝑧⟩ ∈ ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) → 𝑧 = 𝑦) ↔ ((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦))
65	64	albii 1841	. . . . . . . . 9 ⊢ (∀𝑧(⟨𝑥, 𝑧⟩ ∈ ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) → 𝑧 = 𝑦) ↔ ∀𝑧((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦))
66	65	exbii 1870	. . . . . . . 8 ⊢ (∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) → 𝑧 = 𝑦) ↔ ∃𝑦∀𝑧((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦))
67	66	albii 1841	. . . . . . 7 ⊢ (∀𝑥∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) → 𝑧 = 𝑦) ↔ ∀𝑥∃𝑦∀𝑧((𝑥 ∈ 𝐷 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐹) → 𝑧 = 𝑦))
68	54, 67	sylibr 236	. . . . . 6 ⊢ (∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎}) → ∀𝑥∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) → 𝑧 = 𝑦))
69		dffun5 6537	. . . . . 6 ⊢ (Fun ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) ↔ (Rel ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) ∧ ∀𝑥∃𝑦∀𝑧(⟨𝑥, 𝑧⟩ ∈ ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}) → 𝑧 = 𝑦)))
70	10, 68, 69	sylanbrc 592	. . . . 5 ⊢ (∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎}) → Fun ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}))
71	58	eqcomi 2773	. . . . . . . 8 ⊢ 𝐷 = ∪ 𝑎 ∈ 𝐷 {𝑎}
72	71	reseq2i 5964	. . . . . . 7 ⊢ (𝐹 ↾ 𝐷) = (𝐹 ↾ ∪ 𝑎 ∈ 𝐷 {𝑎})
73	72	funeqi 6544	. . . . . 6 ⊢ (Fun (𝐹 ↾ 𝐷) ↔ Fun (𝐹 ↾ ∪ 𝑎 ∈ 𝐷 {𝑎}))
74	55	funeqi 6544	. . . . . 6 ⊢ (Fun (𝐹 ↾ ∪ 𝑎 ∈ 𝐷 {𝑎}) ↔ Fun ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}))
75	73, 74	bitri 277	. . . . 5 ⊢ (Fun (𝐹 ↾ 𝐷) ↔ Fun ∪ 𝑎 ∈ 𝐷 (𝐹 ↾ {𝑎}))
76	70, 75	sylibr 236	. . . 4 ⊢ (∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎}) → Fun (𝐹 ↾ 𝐷))
77	6, 76	anim12i 622	. . 3 ⊢ ((∀𝑎 ∈ 𝐷 𝑎 ∈ dom 𝐹 ∧ ∀𝑎 ∈ 𝐷 Fun (𝐹 ↾ {𝑎})) → (𝐷 ⊆ dom 𝐹 ∧ Fun (𝐹 ↾ 𝐷)))
78	3, 77	sylbi 219	. 2 ⊢ (∀𝑎 ∈ 𝐷 (𝑎 ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {𝑎})) → (𝐷 ⊆ dom 𝐹 ∧ Fun (𝐹 ↾ 𝐷)))
79	2, 78	syl 17	1 ⊢ (∀𝑎 ∈ 𝐷 (𝐹‘𝑎) ≠ ∅ → (𝐷 ⊆ dom 𝐹 ∧ Fun (𝐹 ↾ 𝐷)))

Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1560   = wceq 1562  ∃wex 1801   ∈ wcel 2144   ≠ wne 2959  ∀wral 3078   ⊆ wss 3906  ∅c0 4287  {csn 4584  ⟨cop 4590  ∪ ciun 4951  dom cdm 5649   ↾ cres 5651  Rel wrel 5654  Fun wfun 6517  ‘cfv 6523

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-11 2193  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-res 5661  df-iota 6479  df-fun 6525  df-fv 6531

This theorem is referenced by:  fveqressseq  7062  ovn0ssdmfun  48786