Theorem frrlem6 8315

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 8314	. . . 4 ⊢ 𝐹 = ∪ 𝐵
4	3	releqi 5790	. . 3 ⊢ (Rel 𝐹 ↔ Rel ∪ 𝐵)
5		reluni 5831	. . 3 ⊢ (Rel ∪ 𝐵 ↔ ∀𝑔 ∈ 𝐵 Rel 𝑔)
6	4, 5	bitri 275	. 2 ⊢ (Rel 𝐹 ↔ ∀𝑔 ∈ 𝐵 Rel 𝑔)
7	1	frrlem2 8311	. . 3 ⊢ (𝑔 ∈ 𝐵 → Fun 𝑔)
8		funrel 6585	. . 3 ⊢ (Fun 𝑔 → Rel 𝑔)
9	7, 8	syl 17	. 2 ⊢ (𝑔 ∈ 𝐵 → Rel 𝑔)
10	6, 9	mprgbir 3066	1 ⊢ Rel 𝐹

Syntax hints:   ∧ wa 395   ∧ w3a 1086   = wceq 1537  ∃wex 1776   ∈ wcel 2106  {cab 2712  ∀wral 3059   ⊆ wss 3963  ∪ cuni 4912   ↾ cres 5691  Rel wrel 5694  Predcpred 6322  Fun wfun 6557   Fn wfn 6558  ‘cfv 6563  (class class class)co 7431  frecscfrecs 8304

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 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-iota 6516  df-fun 6565  df-fn 6566  df-fv 6571  df-ov 7434  df-frecs 8305

This theorem is referenced by:  frrlem9  8318  frrrel  8330