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

Theorem dfrecs2 36530
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.
StepHypRef Expression
1 dfrecs3 8362 . 2 recs(𝐹) = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
2 elin 3915 . . . . . . . . 9 (𝑓 ∈ ( Funs ∩ (Domain “ On)) ↔ (𝑓 Funs 𝑓 ∈ (Domain “ On)))
3 vex 3454 . . . . . . . . . . 11 𝑓 ∈ V
43elfuns 36493 . . . . . . . . . 10 (𝑓 Funs ↔ Fun 𝑓)
5 vex 3454 . . . . . . . . . . . . . 14 𝑥 ∈ V
65, 3brcnv 5862 . . . . . . . . . . . . 13 (𝑥Domain𝑓𝑓Domain𝑥)
73, 5brdomain 36511 . . . . . . . . . . . . 13 (𝑓Domain𝑥𝑥 = dom 𝑓)
86, 7bitri 278 . . . . . . . . . . . 12 (𝑥Domain𝑓𝑥 = dom 𝑓)
98rexbii 3109 . . . . . . . . . . 11 (∃𝑥 ∈ On 𝑥Domain𝑓 ↔ ∃𝑥 ∈ On 𝑥 = dom 𝑓)
103elima 6061 . . . . . . . . . . 11 (𝑓 ∈ (Domain “ On) ↔ ∃𝑥 ∈ On 𝑥Domain𝑓)
11 risset 3237 . . . . . . . . . . 11 (dom 𝑓 ∈ On ↔ ∃𝑥 ∈ On 𝑥 = dom 𝑓)
129, 10, 113bitr4i 306 . . . . . . . . . 10 (𝑓 ∈ (Domain “ On) ↔ dom 𝑓 ∈ On)
134, 12anbi12i 640 . . . . . . . . 9 ((𝑓 Funs 𝑓 ∈ (Domain “ On)) ↔ (Fun 𝑓 ∧ dom 𝑓 ∈ On))
142, 13bitri 278 . . . . . . . 8 (𝑓 ∈ ( Funs ∩ (Domain “ On)) ↔ (Fun 𝑓 ∧ dom 𝑓 ∈ On))
153eldm 5884 . . . . . . . . . . 11 (𝑓 ∈ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))) ↔ ∃𝑦 𝑓(( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))𝑦)
16 brdif 5158 . . . . . . . . . . . . 13 (𝑓(( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))𝑦 ↔ (𝑓( E ∘ Domain)𝑦 ∧ ¬ 𝑓 Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦))
17 vex 3454 . . . . . . . . . . . . . . . 16 𝑦 ∈ V
183, 17brco 5850 . . . . . . . . . . . . . . 15 (𝑓( E ∘ Domain)𝑦 ↔ ∃𝑥(𝑓Domain𝑥𝑥 E 𝑦))
197anbi1i 636 . . . . . . . . . . . . . . . . 17 ((𝑓Domain𝑥𝑥 E 𝑦) ↔ (𝑥 = dom 𝑓𝑥 E 𝑦))
2019exbii 1881 . . . . . . . . . . . . . . . 16 (∃𝑥(𝑓Domain𝑥𝑥 E 𝑦) ↔ ∃𝑥(𝑥 = dom 𝑓𝑥 E 𝑦))
213dmex 7907 . . . . . . . . . . . . . . . . 17 dom 𝑓 ∈ V
22 breq1 5106 . . . . . . . . . . . . . . . . 17 (𝑥 = dom 𝑓 → (𝑥 E 𝑦 ↔ dom 𝑓 E 𝑦))
2321, 22ceqsexv 3498 . . . . . . . . . . . . . . . 16 (∃𝑥(𝑥 = dom 𝑓𝑥 E 𝑦) ↔ dom 𝑓 E 𝑦)
2420, 23bitri 278 . . . . . . . . . . . . . . 15 (∃𝑥(𝑓Domain𝑥𝑥 E 𝑦) ↔ dom 𝑓 E 𝑦)
2521, 17brcnv 5862 . . . . . . . . . . . . . . . 16 (dom 𝑓 E 𝑦𝑦 E dom 𝑓)
2621epeli 5557 . . . . . . . . . . . . . . . 16 (𝑦 E dom 𝑓𝑦 ∈ dom 𝑓)
2725, 26bitri 278 . . . . . . . . . . . . . . 15 (dom 𝑓 E 𝑦𝑦 ∈ dom 𝑓)
2818, 24, 273bitri 300 . . . . . . . . . . . . . 14 (𝑓( E ∘ Domain)𝑦𝑦 ∈ dom 𝑓)
29 df-br 5104 . . . . . . . . . . . . . . . 16 (𝑓 Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦 ↔ ⟨𝑓, 𝑦⟩ ∈ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))
30 opex 5439 . . . . . . . . . . . . . . . . 17 𝑓, 𝑦⟩ ∈ V
3130elfix 36481 . . . . . . . . . . . . . . . 16 (⟨𝑓, 𝑦⟩ ∈ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)) ↔ ⟨𝑓, 𝑦⟩(Apply ∘ (FullFun𝐹 ∘ Restrict))⟨𝑓, 𝑦⟩)
3230, 30brco 5850 . . . . . . . . . . . . . . . . 17 (⟨𝑓, 𝑦⟩(Apply ∘ (FullFun𝐹 ∘ Restrict))⟨𝑓, 𝑦⟩ ↔ ∃𝑥(⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥𝑥Apply⟨𝑓, 𝑦⟩))
33 ancom 466 . . . . . . . . . . . . . . . . . . . 20 ((⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥𝑥Apply⟨𝑓, 𝑦⟩) ↔ (𝑥Apply⟨𝑓, 𝑦⟩ ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥))
345, 30brcnv 5862 . . . . . . . . . . . . . . . . . . . . . 22 (𝑥Apply⟨𝑓, 𝑦⟩ ↔ ⟨𝑓, 𝑦⟩Apply𝑥)
353, 17, 5brapply 36516 . . . . . . . . . . . . . . . . . . . . . 22 (⟨𝑓, 𝑦⟩Apply𝑥𝑥 = (𝑓𝑦))
3634, 35bitri 278 . . . . . . . . . . . . . . . . . . . . 21 (𝑥Apply⟨𝑓, 𝑦⟩ ↔ 𝑥 = (𝑓𝑦))
3736anbi1i 636 . . . . . . . . . . . . . . . . . . . 20 ((𝑥Apply⟨𝑓, 𝑦⟩ ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥) ↔ (𝑥 = (𝑓𝑦) ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥))
3833, 37bitri 278 . . . . . . . . . . . . . . . . . . 19 ((⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥𝑥Apply⟨𝑓, 𝑦⟩) ↔ (𝑥 = (𝑓𝑦) ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥))
3938exbii 1881 . . . . . . . . . . . . . . . . . 18 (∃𝑥(⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥𝑥Apply⟨𝑓, 𝑦⟩) ↔ ∃𝑥(𝑥 = (𝑓𝑦) ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥))
40 fvex 6892 . . . . . . . . . . . . . . . . . . 19 (𝑓𝑦) ∈ V
41 breq2 5107 . . . . . . . . . . . . . . . . . . 19 (𝑥 = (𝑓𝑦) → (⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥 ↔ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓𝑦)))
4240, 41ceqsexv 3498 . . . . . . . . . . . . . . . . . 18 (∃𝑥(𝑥 = (𝑓𝑦) ∧ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥) ↔ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓𝑦))
4339, 42bitri 278 . . . . . . . . . . . . . . . . 17 (∃𝑥(⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)𝑥𝑥Apply⟨𝑓, 𝑦⟩) ↔ ⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓𝑦))
4430, 40brco 5850 . . . . . . . . . . . . . . . . . 18 (⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓𝑦) ↔ ∃𝑥(⟨𝑓, 𝑦⟩Restrict𝑥𝑥FullFun𝐹(𝑓𝑦)))
453, 17, 5brrestrict 36529 . . . . . . . . . . . . . . . . . . . . 21 (⟨𝑓, 𝑦⟩Restrict𝑥𝑥 = (𝑓𝑦))
4645anbi1i 636 . . . . . . . . . . . . . . . . . . . 20 ((⟨𝑓, 𝑦⟩Restrict𝑥𝑥FullFun𝐹(𝑓𝑦)) ↔ (𝑥 = (𝑓𝑦) ∧ 𝑥FullFun𝐹(𝑓𝑦)))
4746exbii 1881 . . . . . . . . . . . . . . . . . . 19 (∃𝑥(⟨𝑓, 𝑦⟩Restrict𝑥𝑥FullFun𝐹(𝑓𝑦)) ↔ ∃𝑥(𝑥 = (𝑓𝑦) ∧ 𝑥FullFun𝐹(𝑓𝑦)))
483resex 6022 . . . . . . . . . . . . . . . . . . . 20 (𝑓𝑦) ∈ V
49 breq1 5106 . . . . . . . . . . . . . . . . . . . 20 (𝑥 = (𝑓𝑦) → (𝑥FullFun𝐹(𝑓𝑦) ↔ (𝑓𝑦)FullFun𝐹(𝑓𝑦)))
5048, 49ceqsexv 3498 . . . . . . . . . . . . . . . . . . 19 (∃𝑥(𝑥 = (𝑓𝑦) ∧ 𝑥FullFun𝐹(𝑓𝑦)) ↔ (𝑓𝑦)FullFun𝐹(𝑓𝑦))
5147, 50bitri 278 . . . . . . . . . . . . . . . . . 18 (∃𝑥(⟨𝑓, 𝑦⟩Restrict𝑥𝑥FullFun𝐹(𝑓𝑦)) ↔ (𝑓𝑦)FullFun𝐹(𝑓𝑦))
5248, 40brfullfun 36528 . . . . . . . . . . . . . . . . . 18 ((𝑓𝑦)FullFun𝐹(𝑓𝑦) ↔ (𝑓𝑦) = (𝐹‘(𝑓𝑦)))
5344, 51, 523bitri 300 . . . . . . . . . . . . . . . . 17 (⟨𝑓, 𝑦⟩(FullFun𝐹 ∘ Restrict)(𝑓𝑦) ↔ (𝑓𝑦) = (𝐹‘(𝑓𝑦)))
5432, 43, 533bitri 300 . . . . . . . . . . . . . . . 16 (⟨𝑓, 𝑦⟩(Apply ∘ (FullFun𝐹 ∘ Restrict))⟨𝑓, 𝑦⟩ ↔ (𝑓𝑦) = (𝐹‘(𝑓𝑦)))
5529, 31, 543bitri 300 . . . . . . . . . . . . . . 15 (𝑓 Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦 ↔ (𝑓𝑦) = (𝐹‘(𝑓𝑦)))
5655notbii 323 . . . . . . . . . . . . . 14 𝑓 Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦 ↔ ¬ (𝑓𝑦) = (𝐹‘(𝑓𝑦)))
5728, 56anbi12i 640 . . . . . . . . . . . . 13 ((𝑓( E ∘ Domain)𝑦 ∧ ¬ 𝑓 Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))𝑦) ↔ (𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓𝑦) = (𝐹‘(𝑓𝑦))))
5816, 57bitri 278 . . . . . . . . . . . 12 (𝑓(( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))𝑦 ↔ (𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓𝑦) = (𝐹‘(𝑓𝑦))))
5958exbii 1881 . . . . . . . . . . 11 (∃𝑦 𝑓(( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))𝑦 ↔ ∃𝑦(𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓𝑦) = (𝐹‘(𝑓𝑦))))
6015, 59bitri 278 . . . . . . . . . 10 (𝑓 ∈ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))) ↔ ∃𝑦(𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓𝑦) = (𝐹‘(𝑓𝑦))))
61 df-rex 3087 . . . . . . . . . 10 (∃𝑦 ∈ dom 𝑓 ¬ (𝑓𝑦) = (𝐹‘(𝑓𝑦)) ↔ ∃𝑦(𝑦 ∈ dom 𝑓 ∧ ¬ (𝑓𝑦) = (𝐹‘(𝑓𝑦))))
62 rexnal 3114 . . . . . . . . . 10 (∃𝑦 ∈ dom 𝑓 ¬ (𝑓𝑦) = (𝐹‘(𝑓𝑦)) ↔ ¬ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦)))
6360, 61, 623bitr2ri 303 . . . . . . . . 9 (¬ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦)) ↔ 𝑓 ∈ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))))
6463con1bii 359 . . . . . . . 8 𝑓 ∈ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))) ↔ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦)))
6514, 64anbi12i 640 . . . . . . 7 ((𝑓 ∈ ( Funs ∩ (Domain “ On)) ∧ ¬ 𝑓 ∈ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ ((Fun 𝑓 ∧ dom 𝑓 ∈ On) ∧ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦))))
66 anass 474 . . . . . . 7 (((Fun 𝑓 ∧ dom 𝑓 ∈ On) ∧ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦))) ↔ (Fun 𝑓 ∧ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
6765, 66bitri 278 . . . . . 6 ((𝑓 ∈ ( Funs ∩ (Domain “ On)) ∧ ¬ 𝑓 ∈ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ (Fun 𝑓 ∧ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
68 eleq1 2848 . . . . . . . . 9 (𝑥 = dom 𝑓 → (𝑥 ∈ On ↔ dom 𝑓 ∈ On))
69 raleq 3316 . . . . . . . . 9 (𝑥 = dom 𝑓 → (∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)) ↔ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦))))
7068, 69anbi12d 644 . . . . . . . 8 (𝑥 = dom 𝑓 → ((𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦))) ↔ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
7170anbi2d 642 . . . . . . 7 (𝑥 = dom 𝑓 → ((Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))) ↔ (Fun 𝑓 ∧ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦))))))
7221, 71ceqsexv 3498 . . . . . 6 (∃𝑥(𝑥 = dom 𝑓 ∧ (Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦))))) ↔ (Fun 𝑓 ∧ (dom 𝑓 ∈ On ∧ ∀𝑦 ∈ dom 𝑓(𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
73 df-fn 6536 . . . . . . . . . 10 (𝑓 Fn 𝑥 ↔ (Fun 𝑓 ∧ dom 𝑓 = 𝑥))
74 eqcom 2767 . . . . . . . . . . 11 (dom 𝑓 = 𝑥𝑥 = dom 𝑓)
7574anbi2i 635 . . . . . . . . . 10 ((Fun 𝑓 ∧ dom 𝑓 = 𝑥) ↔ (Fun 𝑓𝑥 = dom 𝑓))
76 ancom 466 . . . . . . . . . 10 ((Fun 𝑓𝑥 = dom 𝑓) ↔ (𝑥 = dom 𝑓 ∧ Fun 𝑓))
7773, 75, 763bitri 300 . . . . . . . . 9 (𝑓 Fn 𝑥 ↔ (𝑥 = dom 𝑓 ∧ Fun 𝑓))
7877anbi1i 636 . . . . . . . 8 ((𝑓 Fn 𝑥 ∧ (𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))) ↔ ((𝑥 = dom 𝑓 ∧ Fun 𝑓) ∧ (𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
79 an12 658 . . . . . . . 8 ((𝑓 Fn 𝑥 ∧ (𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))) ↔ (𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
80 anass 474 . . . . . . . 8 (((𝑥 = dom 𝑓 ∧ Fun 𝑓) ∧ (𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))) ↔ (𝑥 = dom 𝑓 ∧ (Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦))))))
8178, 79, 803bitr3ri 305 . . . . . . 7 ((𝑥 = dom 𝑓 ∧ (Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦))))) ↔ (𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
8281exbii 1881 . . . . . 6 (∃𝑥(𝑥 = dom 𝑓 ∧ (Fun 𝑓 ∧ (𝑥 ∈ On ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦))))) ↔ ∃𝑥(𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
8367, 72, 823bitr2i 302 . . . . 5 ((𝑓 ∈ ( Funs ∩ (Domain “ On)) ∧ ¬ 𝑓 ∈ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ ∃𝑥(𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
84 eldif 3909 . . . . 5 (𝑓 ∈ (( Funs ∩ (Domain “ On)) ∖ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ (𝑓 ∈ ( Funs ∩ (Domain “ On)) ∧ ¬ 𝑓 ∈ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))))
85 df-rex 3087 . . . . 5 (∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦))) ↔ ∃𝑥(𝑥 ∈ On ∧ (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))))
8683, 84, 853bitr4i 306 . . . 4 (𝑓 ∈ (( Funs ∩ (Domain “ On)) ∖ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))) ↔ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦))))
8786eqabi 2895 . . 3 (( Funs ∩ (Domain “ On)) ∖ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))) = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
8887unieqi 4879 . 2 (( Funs ∩ (Domain “ On)) ∖ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict)))) = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
891, 88eqtr4i 2786 1 recs(𝐹) = (( Funs ∩ (Domain “ On)) ∖ dom (( E ∘ Domain) ∖ Fix (Apply ∘ (FullFun𝐹 ∘ Restrict))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wa 401   = wceq 1570  wex 1812  wcel 2145  {cab 2738  wral 3076  wrex 3086  cdif 3896  cin 3898  cop 4590   cuni 4867   class class class wbr 5103   E cep 5554  ccnv 5654  dom cdm 5655  cres 5657  cima 5658  ccom 5659  Oncon0 6357  Fun wfun 6527   Fn wfn 6528  cfv 6533  recscrecs 8360   Fix cfix 36413   Funs cfuns 36415  Domaincdomain 36421  Applycapply 36423  FullFuncfullfn 36428  Restrictcrestrict 36429
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 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-symdif 4199  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fo 6539  df-fv 6541  df-ov 7417  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-txp 36432  df-pprod 36433  df-bigcup 36436  df-fix 36437  df-funs 36439  df-singleton 36440  df-singles 36441  df-image 36442  df-cart 36443  df-img 36444  df-domain 36445  df-range 36446  df-cap 36448  df-restrict 36449  df-apply 36451  df-funpart 36452  df-fullfun 36453
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator