dfrecs2 - Mathbox for Scott Fenton

	Mathbox for Scott Fenton		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > dfrecs2		Structured version Visualization version GIF version

Theorem dfrecs2 33411

Description: A quantifier-free definition of recs. (Contributed by Scott Fenton, 17-Jul-2020.)

**Assertion**
Ref	Expression
dfrecs2	⊢ recs(𝐹) = ∪ (( Funs ∩ (^◡Domain “ On)) ∖ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))))

Proof of Theorem dfrecs2 Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfrecs3 8008	. 2 ⊢ recs(𝐹) = ∪ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
2		elin 4168	. . . . . . . . 9 ⊢ (𝑓 ∈ ( Funs ∩ (^◡Domain “ On)) ↔ (𝑓 ∈ Funs ∧ 𝑓 ∈ (^◡Domain “ On)))
3		vex 3497	. . . . . . . . . . 11 ⊢ 𝑓 ∈ V
4	3	elfuns 33376	. . . . . . . . . 10 ⊢ (𝑓 ∈ Funs ↔ Fun 𝑓)
5		vex 3497	. . . . . . . . . . . . . 14 ⊢ 𝑥 ∈ V
6	5, 3	brcnv 5752	. . . . . . . . . . . . 13 ⊢ (𝑥^◡Domain𝑓 ↔ 𝑓Domain𝑥)
7	3, 5	brdomain 33394	. . . . . . . . . . . . 13 ⊢ (𝑓Domain𝑥 ↔ 𝑥 = dom 𝑓)
8	6, 7	bitri 277	. . . . . . . . . . . 12 ⊢ (𝑥^◡Domain𝑓 ↔ 𝑥 = dom 𝑓)
9	8	rexbii 3247	. . . . . . . . . . 11 ⊢ (∃𝑥 ∈ On 𝑥^◡Domain𝑓 ↔ ∃𝑥 ∈ On 𝑥 = dom 𝑓)
10	3	elima 5933	. . . . . . . . . . 11 ⊢ (𝑓 ∈ (^◡Domain “ On) ↔ ∃𝑥 ∈ On 𝑥^◡Domain𝑓)
11		risset 3267	. . . . . . . . . . 11 ⊢ (dom 𝑓 ∈ On ↔ ∃𝑥 ∈ On 𝑥 = dom 𝑓)
12	9, 10, 11	3bitr4i 305	. . . . . . . . . 10 ⊢ (𝑓 ∈ (^◡Domain “ On) ↔ dom 𝑓 ∈ On)
13	4, 12	anbi12i 628	. . . . . . . . 9 ⊢ ((𝑓 ∈ Funs ∧ 𝑓 ∈ (^◡Domain “ On)) ↔ (Fun 𝑓 ∧ dom 𝑓 ∈ On))
14	2, 13	bitri 277	. . . . . . . 8 ⊢ (𝑓 ∈ ( Funs ∩ (^◡Domain “ On)) ↔ (Fun 𝑓 ∧ dom 𝑓 ∈ On))
15	3	eldm 5768	. . . . . . . . . . 11 ⊢ (𝑓 ∈ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))) ↔ ∃𝑦 𝑓((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))𝑦)
16		brdif 5118	. . . . . . . . . . . . 13 ⊢ (𝑓((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))𝑦 ↔ (𝑓(^◡ E ∘ Domain)𝑦 ∧ ¬ 𝑓 Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦))
17		vex 3497	. . . . . . . . . . . . . . . 16 ⊢ 𝑦 ∈ V
18	3, 17	brco 5740	. . . . . . . . . . . . . . 15 ⊢ (𝑓(^◡ E ∘ Domain)𝑦 ↔ ∃𝑥(𝑓Domain𝑥 ∧ 𝑥^◡ E 𝑦))
19	7	anbi1i 625	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓Domain𝑥 ∧ 𝑥^◡ E 𝑦) ↔ (𝑥 = dom 𝑓 ∧ 𝑥^◡ E 𝑦))
20	19	exbii 1844	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑥(𝑓Domain𝑥 ∧ 𝑥^◡ E 𝑦) ↔ ∃𝑥(𝑥 = dom 𝑓 ∧ 𝑥^◡ E 𝑦))
21	3	dmex 7615	. . . . . . . . . . . . . . . . 17 ⊢ dom 𝑓 ∈ V
22		breq1 5068	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = dom 𝑓 → (𝑥^◡ E 𝑦 ↔ dom 𝑓^◡ E 𝑦))
23	21, 22	ceqsexv 3541	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑥(𝑥 = dom 𝑓 ∧ 𝑥^◡ E 𝑦) ↔ dom 𝑓^◡ E 𝑦)
24	20, 23	bitri 277	. . . . . . . . . . . . . . 15 ⊢ (∃𝑥(𝑓Domain𝑥 ∧ 𝑥^◡ E 𝑦) ↔ dom 𝑓^◡ E 𝑦)
25	21, 17	brcnv 5752	. . . . . . . . . . . . . . . 16 ⊢ (dom 𝑓^◡ E 𝑦 ↔ 𝑦 E dom 𝑓)
26	21	epeli 5467	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 E dom 𝑓 ↔ 𝑦 ∈ dom 𝑓)
27	25, 26	bitri 277	. . . . . . . . . . . . . . 15 ⊢ (dom 𝑓^◡ E 𝑦 ↔ 𝑦 ∈ dom 𝑓)
28	18, 24, 27	3bitri 299	. . . . . . . . . . . . . 14 ⊢ (𝑓(^◡ E ∘ Domain)𝑦 ↔ 𝑦 ∈ dom 𝑓)
29		df-br 5066	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦 ↔ ⟨𝑓, 𝑦⟩ ∈ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))
30		opex 5355	. . . . . . . . . . . . . . . . 17 ⊢ ⟨𝑓, 𝑦⟩ ∈ V
31	30	elfix 33364	. . . . . . . . . . . . . . . 16 ⊢ (⟨𝑓, 𝑦⟩ ∈ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)) ↔ ⟨𝑓, 𝑦⟩(^◡Apply ∘ (FullFun𝐹 ∘ Restrict))⟨𝑓, 𝑦⟩)
32	30, 30	brco 5740	. . . . . . . . . . . . . . . . 17 ⊢ (⟨𝑓, 𝑦⟩(^◡Apply ∘ (FullFun𝐹 ∘ Restrict))⟨𝑓, 𝑦⟩ ↔ ∃𝑥(⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥 ∧ 𝑥^◡Apply⟨𝑓, 𝑦⟩))
33		ancom 463	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥 ∧ 𝑥^◡Apply⟨𝑓, 𝑦⟩) ↔ (𝑥^◡Apply⟨𝑓, 𝑦⟩ ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥))
34	5, 30	brcnv 5752	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥^◡Apply⟨𝑓, 𝑦⟩ ↔ ⟨𝑓, 𝑦⟩Apply𝑥)
35	3, 17, 5	brapply 33399	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (⟨𝑓, 𝑦⟩Apply𝑥 ↔ 𝑥 = (𝑓‘𝑦))
36	34, 35	bitri 277	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥^◡Apply⟨𝑓, 𝑦⟩ ↔ 𝑥 = (𝑓‘𝑦))
37	36	anbi1i 625	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥^◡Apply⟨𝑓, 𝑦⟩ ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥) ↔ (𝑥 = (𝑓‘𝑦) ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥))
38	33, 37	bitri 277	. . . . . . . . . . . . . . . . . . 19 ⊢ ((⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥 ∧ 𝑥^◡Apply⟨𝑓, 𝑦⟩) ↔ (𝑥 = (𝑓‘𝑦) ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥))
39	38	exbii 1844	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑥(⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥 ∧ 𝑥^◡Apply⟨𝑓, 𝑦⟩) ↔ ∃𝑥(𝑥 = (𝑓‘𝑦) ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥))
40		fvex 6682	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓‘𝑦) ∈ V
41		breq2 5069	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = (𝑓‘𝑦) → (⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥 ↔ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓‘𝑦)))
42	40, 41	ceqsexv 3541	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑥(𝑥 = (𝑓‘𝑦) ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥) ↔ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓‘𝑦))
43	39, 42	bitri 277	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑥(⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥 ∧ 𝑥^◡Apply⟨𝑓, 𝑦⟩) ↔ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓‘𝑦))
44	30, 40	brco 5740	. . . . . . . . . . . . . . . . . 18 ⊢ (⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓‘𝑦) ↔ ∃𝑥(⟨𝑓, 𝑦⟩Restrict𝑥 ∧ 𝑥FullFun𝐹(𝑓‘𝑦)))
45	3, 17, 5	brrestrict 33410	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (⟨𝑓, 𝑦⟩Restrict𝑥 ↔ 𝑥 = (𝑓 ↾ 𝑦))
46	45	anbi1i 625	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((⟨𝑓, 𝑦⟩Restrict𝑥 ∧ 𝑥FullFun𝐹(𝑓‘𝑦)) ↔ (𝑥 = (𝑓 ↾ 𝑦) ∧ 𝑥FullFun𝐹(𝑓‘𝑦)))
47	46	exbii 1844	. . . . . . . . . . . . . . . . . . 19 ⊢ (∃𝑥(⟨𝑓, 𝑦⟩Restrict𝑥 ∧ 𝑥FullFun𝐹(𝑓‘𝑦)) ↔ ∃𝑥(𝑥 = (𝑓 ↾ 𝑦) ∧ 𝑥FullFun𝐹(𝑓‘𝑦)))
48	3	resex 5898	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓 ↾ 𝑦) ∈ V
49		breq1 5068	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = (𝑓 ↾ 𝑦) → (𝑥FullFun𝐹(𝑓‘𝑦) ↔ (𝑓 ↾ 𝑦)FullFun𝐹(𝑓‘𝑦)))
50	48, 49	ceqsexv 3541	. . . . . . . . . . . . . . . . . . 19 ⊢ (∃𝑥(𝑥 = (𝑓 ↾ 𝑦) ∧ 𝑥FullFun𝐹(𝑓‘𝑦)) ↔ (𝑓 ↾ 𝑦)FullFun𝐹(𝑓‘𝑦))
51	47, 50	bitri 277	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑥(⟨𝑓, 𝑦⟩Restrict𝑥 ∧ 𝑥FullFun𝐹(𝑓‘𝑦)) ↔ (𝑓 ↾ 𝑦)FullFun𝐹(𝑓‘𝑦))
52	48, 40	brfullfun 33409	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓 ↾ 𝑦)FullFun𝐹(𝑓‘𝑦) ↔ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))
53	44, 51, 52	3bitri 299	. . . . . . . . . . . . . . . . 17 ⊢ (⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓‘𝑦) ↔ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))
54	32, 43, 53	3bitri 299	. . . . . . . . . . . . . . . 16 ⊢ (⟨𝑓, 𝑦⟩(^◡Apply ∘ (FullFun𝐹 ∘ Restrict))⟨𝑓, 𝑦⟩ ↔ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))
55	29, 31, 54	3bitri 299	. . . . . . . . . . . . . . 15 ⊢ (𝑓 Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦 ↔ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))
56	55	notbii 322	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑓 Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦 ↔ ¬ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))
57	28, 56	anbi12i 628	. . . . . . . . . . . . 13 ⊢ ((𝑓(^◡ E ∘ Domain)𝑦 ∧ ¬ 𝑓 Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦) ↔ (𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))
58	16, 57	bitri 277	. . . . . . . . . . . 12 ⊢ (𝑓((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))𝑦 ↔ (𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))
59	58	exbii 1844	. . . . . . . . . . 11 ⊢ (∃𝑦 𝑓((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))𝑦 ↔ ∃𝑦(𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))
60	15, 59	bitri 277	. . . . . . . . . 10 ⊢ (𝑓 ∈ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))) ↔ ∃𝑦(𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))
61		df-rex 3144	. . . . . . . . . 10 ⊢ (∃𝑦 ∈ dom 𝑓 ¬ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)) ↔ ∃𝑦(𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))
62		rexnal 3238	. . . . . . . . . 10 ⊢ (∃𝑦 ∈ dom 𝑓 ¬ (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)) ↔ ¬ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))
63	60, 61, 62	3bitr2ri 302	. . . . . . . . 9 ⊢ (¬ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)) ↔ 𝑓 ∈ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))))
64	63	con1bii 359	. . . . . . . 8 ⊢ (¬ 𝑓 ∈ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))) ↔ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))
65	14, 64	anbi12i 628	. . . . . . 7 ⊢ ((𝑓 ∈ ( Funs ∩ (^◡Domain “ On)) ∧ ¬ 𝑓 ∈ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ ((Fun 𝑓 ∧ dom 𝑓 ∈ On) ∧ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))
66		anass 471	. . . . . . 7 ⊢ (((Fun 𝑓 ∧ dom 𝑓 ∈ On) ∧ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))) ↔ (Fun 𝑓 ∧ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
67	65, 66	bitri 277	. . . . . 6 ⊢ ((𝑓 ∈ ( Funs ∩ (^◡Domain “ On)) ∧ ¬ 𝑓 ∈ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ (Fun 𝑓 ∧ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
68		eleq1 2900	. . . . . . . . 9 ⊢ (𝑥 = dom 𝑓 → (𝑥 ∈ On ↔ dom 𝑓 ∈ On))
69		raleq 3405	. . . . . . . . 9 ⊢ (𝑥 = dom 𝑓 → (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)) ↔ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))
70	68, 69	anbi12d 632	. . . . . . . 8 ⊢ (𝑥 = dom 𝑓 → ((𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))) ↔ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
71	70	anbi2d 630	. . . . . . 7 ⊢ (𝑥 = dom 𝑓 → ((Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))) ↔ (Fun 𝑓 ∧ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))))
72	21, 71	ceqsexv 3541	. . . . . 6 ⊢ (∃𝑥(𝑥 = dom 𝑓 ∧ (Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))) ↔ (Fun 𝑓 ∧ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
73		df-fn 6357	. . . . . . . . . 10 ⊢ (𝑓 Fn 𝑥 ↔ (Fun 𝑓 ∧ dom 𝑓 = 𝑥))
74		eqcom 2828	. . . . . . . . . . 11 ⊢ (dom 𝑓 = 𝑥 ↔ 𝑥 = dom 𝑓)
75	74	anbi2i 624	. . . . . . . . . 10 ⊢ ((Fun 𝑓 ∧ dom 𝑓 = 𝑥) ↔ (Fun 𝑓 ∧ 𝑥 = dom 𝑓))
76		ancom 463	. . . . . . . . . 10 ⊢ ((Fun 𝑓 ∧ 𝑥 = dom 𝑓) ↔ (𝑥 = dom 𝑓 ∧ Fun 𝑓))
77	73, 75, 76	3bitri 299	. . . . . . . . 9 ⊢ (𝑓 Fn 𝑥 ↔ (𝑥 = dom 𝑓 ∧ Fun 𝑓))
78	77	anbi1i 625	. . . . . . . 8 ⊢ ((𝑓 Fn 𝑥 ∧ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))) ↔ ((𝑥 = dom 𝑓 ∧ Fun 𝑓) ∧ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
79		an12 643	. . . . . . . 8 ⊢ ((𝑓 Fn 𝑥 ∧ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))) ↔ (𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
80		anass 471	. . . . . . . 8 ⊢ (((𝑥 = dom 𝑓 ∧ Fun 𝑓) ∧ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))) ↔ (𝑥 = dom 𝑓 ∧ (Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))))
81	78, 79, 80	3bitr3ri 304	. . . . . . 7 ⊢ ((𝑥 = dom 𝑓 ∧ (Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))) ↔ (𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
82	81	exbii 1844	. . . . . 6 ⊢ (∃𝑥(𝑥 = dom 𝑓 ∧ (Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))) ↔ ∃𝑥(𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
83	67, 72, 82	3bitr2i 301	. . . . 5 ⊢ ((𝑓 ∈ ( Funs ∩ (^◡Domain “ On)) ∧ ¬ 𝑓 ∈ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ ∃𝑥(𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
84		eldif 3945	. . . . 5 ⊢ (𝑓 ∈ (( Funs ∩ (^◡Domain “ On)) ∖ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ (𝑓 ∈ ( Funs ∩ (^◡Domain “ On)) ∧ ¬ 𝑓 ∈ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))))
85		df-rex 3144	. . . . 5 ⊢ (∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))) ↔ ∃𝑥(𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))))
86	83, 84, 85	3bitr4i 305	. . . 4 ⊢ (𝑓 ∈ (( Funs ∩ (^◡Domain “ On)) ∖ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦))))
87	86	abbi2i 2953	. . 3 ⊢ (( Funs ∩ (^◡Domain “ On)) ∖ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))) = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
88	87	unieqi 4850	. 2 ⊢ ∪ (( Funs ∩ (^◡Domain “ On)) ∖ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict)))) = ∪ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
89	1, 88	eqtr4i 2847	1 ⊢ recs(𝐹) = ∪ (( Funs ∩ (^◡Domain “ On)) ∖ dom ((^◡ E ∘ Domain) ∖ Fix (^◡Apply ∘ (FullFun𝐹 ∘ Restrict))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ∧ wa 398 = wceq 1533 ∃wex 1776 ∈ wcel 2110 {cab 2799 ∀wral 3138 ∃wrex 3139 ∖ cdif 3932 ∩ cin 3934 ⟨cop 4572 ∪ cuni 4837 class class class wbr 5065 E cep 5463 ^◡ccnv 5553 dom cdm 5554 ↾ cres 5556 “ cima 5557 ∘ ccom 5558 Oncon0 6190 Fun wfun 6348 Fn wfn 6349 ‘cfv 6354 recscrecs 8006 Fix cfix 33296 Funs cfuns 33298 Domaincdomain 33304 Applycapply 33306 FullFuncfullfn 33311 Restrictcrestrict 33312

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 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 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-symdif 4218 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-fo 6360 df-fv 6362 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-txp 33315 df-pprod 33316 df-bigcup 33319 df-fix 33320 df-funs 33322 df-singleton 33323 df-singles 33324 df-image 33325 df-cart 33326 df-img 33327 df-domain 33328 df-range 33329 df-cap 33331 df-restrict 33332 df-apply 33334 df-funpart 33335 df-fullfun 33336

This theorem is referenced by: (None)

W3C validator