Theorem frrlem6 8232

Description: Lemma for well-founded recursion. The well-founded recursion generator is a relation. (Contributed by Scott Fenton, 27-Aug-2022.)

Hypotheses

Ref	Expression
frrlem5.1	⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
frrlem5.2	⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺)

Assertion

Ref	Expression
frrlem6	⊢ Rel 𝐹

Distinct variable groups:   𝐴,𝑓,𝑥,𝑦   𝑓,𝐺,𝑥,𝑦   𝑅,𝑓,𝑥,𝑦

Allowed substitution hints:   𝐵(𝑥,𝑦,𝑓)   𝐹(𝑥,𝑦,𝑓)

Proof of Theorem frrlem6

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		frrlem5.1	. . . . 5 ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
2		frrlem5.2	. . . . 5 ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺)
3	1, 2	frrlem5 8231	. . . 4 ⊢ 𝐹 = ∪ 𝐵
4	3	releqi 5722	. . 3 ⊢ (Rel 𝐹 ↔ Rel ∪ 𝐵)
5		reluni 5762	. . 3 ⊢ (Rel ∪ 𝐵 ↔ ∀𝑔 ∈ 𝐵 Rel 𝑔)
6	4, 5	bitri 276	. 2 ⊢ (Rel 𝐹 ↔ ∀𝑔 ∈ 𝐵 Rel 𝑔)
7	1	frrlem2 8228	. . 3 ⊢ (𝑔 ∈ 𝐵 → Fun 𝑔)
8		funrel 6503	. . 3 ⊢ (Fun 𝑔 → Rel 𝑔)
9	7, 8	syl 17	. 2 ⊢ (𝑔 ∈ 𝐵 → Rel 𝑔)
10	6, 9	mprgbir 3060	1 ⊢ Rel 𝐹

Syntax hints:   ∧ wa 396   ∧ w3a 1092   = wceq 1547  ∃wex 1786   ∈ wcel 2119  {cab 2717  ∀wral 3053   ⊆ wss 3883  ∪ cuni 4839   ↾ cres 5621  Rel wrel 5624  Predcpred 6252  Fun wfun 6480   Fn wfn 6481  ‘cfv 6486  (class class class)co 7357  frecscfrecs 8221

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-11 2168  ax-12 2189  ax-ext 2711

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4263  df-if 4456  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4840  df-iun 4924  df-br 5074  df-opab 5136  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-iota 6442  df-fun 6488  df-fn 6489  df-fv 6494  df-ov 7360  df-frecs 8222

This theorem is referenced by:  frrlem9  8235  frrrel  8247