Metamath Proof Explorer


Theorem nffrecs

Description: Bound-variable hypothesis builder for the well-founded recursion generator. (Contributed by Scott Fenton, 23-Dec-2021)

Ref Expression
Hypotheses nffrecs.1 ⊢ Ⅎ _ x R
nffrecs.2 ⊢ Ⅎ _ x A
nffrecs.3 ⊢ Ⅎ _ x F
Assertion nffrecs ⊢ Ⅎ _ x frecs ⁡ R A F

Proof

Step Hyp Ref Expression
1 nffrecs.1 ⊢ Ⅎ _ x R
2 nffrecs.2 ⊢ Ⅎ _ x A
3 nffrecs.3 ⊢ Ⅎ _ x F
4 df-frecs ⊢ frecs ⁡ R A F = ⋃ f | ∃ y f Fn y ∧ y ⊆ A ∧ ∀ z ∈ y Pred R A z ⊆ y ∧ ∀ z ∈ y f ⁡ z = z F f ↾ Pred R A z
5 nfv ⊢ Ⅎ x f Fn y
6 nfcv ⊢ Ⅎ _ x y
7 6 2 nfss ⊢ Ⅎ x y ⊆ A
8 nfcv ⊢ Ⅎ _ x z
9 1 2 8 nfpred ⊢ Ⅎ _ x Pred R A z
10 9 6 nfss ⊢ Ⅎ x Pred R A z ⊆ y
11 6 10 nfralw ⊢ Ⅎ x ∀ z ∈ y Pred R A z ⊆ y
12 7 11 nfan ⊢ Ⅎ x y ⊆ A ∧ ∀ z ∈ y Pred R A z ⊆ y
13 nfcv ⊢ Ⅎ _ x f
14 13 9 nfres ⊢ Ⅎ _ x f ↾ Pred R A z
15 8 3 14 nfov ⊢ Ⅎ _ x z F f ↾ Pred R A z
16 15 nfeq2 ⊢ Ⅎ x f ⁡ z = z F f ↾ Pred R A z
17 6 16 nfralw ⊢ Ⅎ x ∀ z ∈ y f ⁡ z = z F f ↾ Pred R A z
18 5 12 17 nf3an ⊢ Ⅎ x f Fn y ∧ y ⊆ A ∧ ∀ z ∈ y Pred R A z ⊆ y ∧ ∀ z ∈ y f ⁡ z = z F f ↾ Pred R A z
19 18 nfex ⊢ Ⅎ x ∃ y f Fn y ∧ y ⊆ A ∧ ∀ z ∈ y Pred R A z ⊆ y ∧ ∀ z ∈ y f ⁡ z = z F f ↾ Pred R A z
20 19 nfab ⊢ Ⅎ _ x f | ∃ y f Fn y ∧ y ⊆ A ∧ ∀ z ∈ y Pred R A z ⊆ y ∧ ∀ z ∈ y f ⁡ z = z F f ↾ Pred R A z
21 20 nfuni ⊢ Ⅎ _ x ⋃ f | ∃ y f Fn y ∧ y ⊆ A ∧ ∀ z ∈ y Pred R A z ⊆ y ∧ ∀ z ∈ y f ⁡ z = z F f ↾ Pred R A z
22 4 21 nfcxfr ⊢ Ⅎ _ x frecs ⁡ R A F