Theorem tfrcllemubacc 6412

Description: Lemma for tfrcl 6417. The union of 𝐵 satisfies the recursion rule. (Contributed by Jim Kingdon, 25-Mar-2022.)

Hypotheses

Ref	Expression
tfrcl.f	⊢ 𝐹 = recs(𝐺)
tfrcl.g	⊢ (𝜑 → Fun 𝐺)
tfrcl.x	⊢ (𝜑 → Ord 𝑋)
tfrcl.ex	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆)
tfrcllemsucfn.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
tfrcllembacc.3	⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))}
tfrcllembacc.u	⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
tfrcllembacc.4	⊢ (𝜑 → 𝐷 ∈ 𝑋)
tfrcllembacc.5	⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))))

Assertion

Ref	Expression
tfrcllemubacc	⊢ (𝜑 → ∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)))

Distinct variable groups:   𝐴,𝑓,𝑔,ℎ,𝑥,𝑦,𝑧   𝐷,𝑓,𝑔,𝑥,𝑦   𝑓,𝐺,𝑥,𝑦   𝑆,𝑓,𝑥,𝑦   𝑓,𝑋,𝑥   𝜑,𝑓,𝑔,ℎ,𝑥,𝑦,𝑧   𝐵,𝑔,ℎ,𝑧   𝑢,𝐵,𝑤   𝐷,ℎ,𝑧   𝑢,𝐷,𝑤   𝑤,𝐺   ℎ,𝐺,𝑧   𝑢,𝐺   𝑆,𝑔,ℎ,𝑧   𝑧,𝑋   𝑤,𝑔,𝜑,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑢)   𝐴(𝑤,𝑢)   𝐵(𝑥,𝑦,𝑓)   𝑆(𝑤,𝑢)   𝐹(𝑥,𝑦,𝑧,𝑤,𝑢,𝑓,𝑔,ℎ)   𝐺(𝑔)   𝑋(𝑦,𝑤,𝑢,𝑔,ℎ)

Proof of Theorem tfrcllemubacc

Dummy variables 𝑒 𝑡 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tfrcl.f	. . . . . . . . 9 ⊢ 𝐹 = recs(𝐺)
2		tfrcl.g	. . . . . . . . 9 ⊢ (𝜑 → Fun 𝐺)
3		tfrcl.x	. . . . . . . . 9 ⊢ (𝜑 → Ord 𝑋)
4		tfrcl.ex	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆)
5		tfrcllemsucfn.1	. . . . . . . . 9 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
6		tfrcllembacc.3	. . . . . . . . 9 ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))}
7		tfrcllembacc.u	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
8		tfrcllembacc.4	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ 𝑋)
9		tfrcllembacc.5	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))))
10	1, 2, 3, 4, 5, 6, 7, 8, 9	tfrcllembfn 6410	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝐵:𝐷⟶𝑆)
11		fdm 5409	. . . . . . . 8 ⊢ (∪ 𝐵:𝐷⟶𝑆 → dom ∪ 𝐵 = 𝐷)
12	10, 11	syl 14	. . . . . . 7 ⊢ (𝜑 → dom ∪ 𝐵 = 𝐷)
13	1, 2, 3, 4, 5, 6, 7, 8, 9	tfrcllembacc 6408	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
14	13	unissd 3859	. . . . . . . . 9 ⊢ (𝜑 → ∪ 𝐵 ⊆ ∪ 𝐴)
15	5, 3	tfrcllemssrecs 6405	. . . . . . . . 9 ⊢ (𝜑 → ∪ 𝐴 ⊆ recs(𝐺))
16	14, 15	sstrd 3189	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝐵 ⊆ recs(𝐺))
17		dmss 4861	. . . . . . . 8 ⊢ (∪ 𝐵 ⊆ recs(𝐺) → dom ∪ 𝐵 ⊆ dom recs(𝐺))
18	16, 17	syl 14	. . . . . . 7 ⊢ (𝜑 → dom ∪ 𝐵 ⊆ dom recs(𝐺))
19	12, 18	eqsstrrd 3216	. . . . . 6 ⊢ (𝜑 → 𝐷 ⊆ dom recs(𝐺))
20	19	sselda 3179	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → 𝑤 ∈ dom recs(𝐺))
21		eqid 2193	. . . . . 6 ⊢ {𝑒 ∣ ∃𝑣 ∈ On (𝑒 Fn 𝑣 ∧ ∀𝑡 ∈ 𝑣 (𝑒‘𝑡) = (𝐺‘(𝑒 ↾ 𝑡)))} = {𝑒 ∣ ∃𝑣 ∈ On (𝑒 Fn 𝑣 ∧ ∀𝑡 ∈ 𝑣 (𝑒‘𝑡) = (𝐺‘(𝑒 ↾ 𝑡)))}
22	21	tfrlem9 6372	. . . . 5 ⊢ (𝑤 ∈ dom recs(𝐺) → (recs(𝐺)‘𝑤) = (𝐺‘(recs(𝐺) ↾ 𝑤)))
23	20, 22	syl 14	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (recs(𝐺)‘𝑤) = (𝐺‘(recs(𝐺) ↾ 𝑤)))
24		tfrfun 6373	. . . . 5 ⊢ Fun recs(𝐺)
25	12	eleq2d 2263	. . . . . 6 ⊢ (𝜑 → (𝑤 ∈ dom ∪ 𝐵 ↔ 𝑤 ∈ 𝐷))
26	25	biimpar 297	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → 𝑤 ∈ dom ∪ 𝐵)
27		funssfv 5580	. . . . 5 ⊢ ((Fun recs(𝐺) ∧ ∪ 𝐵 ⊆ recs(𝐺) ∧ 𝑤 ∈ dom ∪ 𝐵) → (recs(𝐺)‘𝑤) = (∪ 𝐵‘𝑤))
28	24, 16, 26, 27	mp3an2ani 1355	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (recs(𝐺)‘𝑤) = (∪ 𝐵‘𝑤))
29		ordelon 4414	. . . . . . . . . 10 ⊢ ((Ord 𝑋 ∧ 𝐷 ∈ 𝑋) → 𝐷 ∈ On)
30	3, 8, 29	syl2anc 411	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ On)
31		eloni 4406	. . . . . . . . 9 ⊢ (𝐷 ∈ On → Ord 𝐷)
32	30, 31	syl 14	. . . . . . . 8 ⊢ (𝜑 → Ord 𝐷)
33		ordelss 4410	. . . . . . . 8 ⊢ ((Ord 𝐷 ∧ 𝑤 ∈ 𝐷) → 𝑤 ⊆ 𝐷)
34	32, 33	sylan 283	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → 𝑤 ⊆ 𝐷)
35	12	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → dom ∪ 𝐵 = 𝐷)
36	34, 35	sseqtrrd 3218	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → 𝑤 ⊆ dom ∪ 𝐵)
37		fun2ssres 5297	. . . . . 6 ⊢ ((Fun recs(𝐺) ∧ ∪ 𝐵 ⊆ recs(𝐺) ∧ 𝑤 ⊆ dom ∪ 𝐵) → (recs(𝐺) ↾ 𝑤) = (∪ 𝐵 ↾ 𝑤))
38	24, 16, 36, 37	mp3an2ani 1355	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (recs(𝐺) ↾ 𝑤) = (∪ 𝐵 ↾ 𝑤))
39	38	fveq2d 5558	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (𝐺‘(recs(𝐺) ↾ 𝑤)) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
40	23, 28, 39	3eqtr3d 2234	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (∪ 𝐵‘𝑤) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
41	40	ralrimiva 2567	. 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝐷 (∪ 𝐵‘𝑤) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
42		fveq2 5554	. . . 4 ⊢ (𝑢 = 𝑤 → (∪ 𝐵‘𝑢) = (∪ 𝐵‘𝑤))
43		reseq2 4937	. . . . 5 ⊢ (𝑢 = 𝑤 → (∪ 𝐵 ↾ 𝑢) = (∪ 𝐵 ↾ 𝑤))
44	43	fveq2d 5558	. . . 4 ⊢ (𝑢 = 𝑤 → (𝐺‘(∪ 𝐵 ↾ 𝑢)) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
45	42, 44	eqeq12d 2208	. . 3 ⊢ (𝑢 = 𝑤 → ((∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)) ↔ (∪ 𝐵‘𝑤) = (𝐺‘(∪ 𝐵 ↾ 𝑤))))
46	45	cbvralv 2726	. 2 ⊢ (∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)) ↔ ∀𝑤 ∈ 𝐷 (∪ 𝐵‘𝑤) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
47	41, 46	sylibr 134	1 ⊢ (𝜑 → ∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 980   = wceq 1364  ∃wex 1503   ∈ wcel 2164  {cab 2179  ∀wral 2472  ∃wrex 2473   ∪ cun 3151   ⊆ wss 3153  {csn 3618  ⟨cop 3621  ∪ cuni 3835  Ord word 4393  Oncon0 4394  suc csuc 4396  dom cdm 4659   ↾ cres 4661  Fun wfun 5248   Fn wfn 5249  ⟶wf 5250  ‘cfv 5254  recscrecs 6357

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-iord 4397  df-on 4399  df-suc 4402  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-recs 6358

This theorem is referenced by:  tfrcllemex  6413