Theorem frrlem6 8236

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 8235	. . . 4 ⊢ 𝐹 = ∪ 𝐵
4	3	releqi 5729	. . 3 ⊢ (Rel 𝐹 ↔ Rel ∪ 𝐵)
5		reluni 5769	. . 3 ⊢ (Rel ∪ 𝐵 ↔ ∀𝑔 ∈ 𝐵 Rel 𝑔)
6	4, 5	bitri 275	. 2 ⊢ (Rel 𝐹 ↔ ∀𝑔 ∈ 𝐵 Rel 𝑔)
7	1	frrlem2 8232	. . 3 ⊢ (𝑔 ∈ 𝐵 → Fun 𝑔)
8		funrel 6511	. . 3 ⊢ (Fun 𝑔 → Rel 𝑔)
9	7, 8	syl 17	. 2 ⊢ (𝑔 ∈ 𝐵 → Rel 𝑔)
10	6, 9	mprgbir 3059	1 ⊢ Rel 𝐹

Syntax hints:   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  {cab 2715  ∀wral 3052   ⊆ wss 3890  ∪ cuni 4851   ↾ cres 5628  Rel wrel 5631  Predcpred 6260  Fun wfun 6488   Fn wfn 6489  ‘cfv 6494  (class class class)co 7362  frecscfrecs 8225

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-12 2185  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-pred 6261  df-iota 6450  df-fun 6496  df-fn 6497  df-fv 6502  df-ov 7365  df-frecs 8226

This theorem is referenced by:  frrlem9  8239  frrrel  8251