Theorem tfr1onlemubacc 6492

Description: Lemma for tfr1on 6496. The union of 𝐵 satisfies the recursion rule. (Contributed by Jim Kingdon, 15-Mar-2022.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem tfr1onlemubacc

Step	Hyp	Ref	Expression
1		tfr1on.f	. . . . . . . . 9 ⊢ 𝐹 = recs(𝐺)
2		tfr1on.g	. . . . . . . . 9 ⊢ (𝜑 → Fun 𝐺)
3		tfr1on.x	. . . . . . . . 9 ⊢ (𝜑 → Ord 𝑋)
4		tfr1on.ex	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V)
5		tfr1onlemsucfn.1	. . . . . . . . 9 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
6		tfr1onlembacc.3	. . . . . . . . 9 ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))}
7		tfr1onlembacc.u	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
8		tfr1onlembacc.4	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ 𝑋)
9		tfr1onlembacc.5	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑧 ∈ 𝐷 ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))))
10	1, 2, 3, 4, 5, 6, 7, 8, 9	tfr1onlembfn 6490	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝐵 Fn 𝐷)
11		fndm 5420	. . . . . . . 8 ⊢ (∪ 𝐵 Fn 𝐷 → dom ∪ 𝐵 = 𝐷)
12	10, 11	syl 14	. . . . . . 7 ⊢ (𝜑 → dom ∪ 𝐵 = 𝐷)
13	1, 2, 3, 4, 5, 6, 7, 8, 9	tfr1onlembacc 6488	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
14	13	unissd 3912	. . . . . . . . 9 ⊢ (𝜑 → ∪ 𝐵 ⊆ ∪ 𝐴)
15	5, 3	tfr1onlemssrecs 6485	. . . . . . . . 9 ⊢ (𝜑 → ∪ 𝐴 ⊆ recs(𝐺))
16	14, 15	sstrd 3234	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝐵 ⊆ recs(𝐺))
17		dmss 4922	. . . . . . . 8 ⊢ (∪ 𝐵 ⊆ recs(𝐺) → dom ∪ 𝐵 ⊆ dom recs(𝐺))
18	16, 17	syl 14	. . . . . . 7 ⊢ (𝜑 → dom ∪ 𝐵 ⊆ dom recs(𝐺))
19	12, 18	eqsstrrd 3261	. . . . . 6 ⊢ (𝜑 → 𝐷 ⊆ dom recs(𝐺))
20	19	sselda 3224	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → 𝑤 ∈ dom recs(𝐺))
21		eqid 2229	. . . . . 6 ⊢ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
22	21	tfrlem9 6465	. . . . 5 ⊢ (𝑤 ∈ dom recs(𝐺) → (recs(𝐺)‘𝑤) = (𝐺‘(recs(𝐺) ↾ 𝑤)))
23	20, 22	syl 14	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (recs(𝐺)‘𝑤) = (𝐺‘(recs(𝐺) ↾ 𝑤)))
24		tfrfun 6466	. . . . 5 ⊢ Fun recs(𝐺)
25	12	eleq2d 2299	. . . . . 6 ⊢ (𝜑 → (𝑤 ∈ dom ∪ 𝐵 ↔ 𝑤 ∈ 𝐷))
26	25	biimpar 297	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → 𝑤 ∈ dom ∪ 𝐵)
27		funssfv 5653	. . . . 5 ⊢ ((Fun recs(𝐺) ∧ ∪ 𝐵 ⊆ recs(𝐺) ∧ 𝑤 ∈ dom ∪ 𝐵) → (recs(𝐺)‘𝑤) = (∪ 𝐵‘𝑤))
28	24, 16, 26, 27	mp3an2ani 1378	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (recs(𝐺)‘𝑤) = (∪ 𝐵‘𝑤))
29		ordelon 4474	. . . . . . . . . 10 ⊢ ((Ord 𝑋 ∧ 𝐷 ∈ 𝑋) → 𝐷 ∈ On)
30	3, 8, 29	syl2anc 411	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ On)
31		eloni 4466	. . . . . . . . 9 ⊢ (𝐷 ∈ On → Ord 𝐷)
32	30, 31	syl 14	. . . . . . . 8 ⊢ (𝜑 → Ord 𝐷)
33		ordelss 4470	. . . . . . . 8 ⊢ ((Ord 𝐷 ∧ 𝑤 ∈ 𝐷) → 𝑤 ⊆ 𝐷)
34	32, 33	sylan 283	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → 𝑤 ⊆ 𝐷)
35	12	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → dom ∪ 𝐵 = 𝐷)
36	34, 35	sseqtrrd 3263	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → 𝑤 ⊆ dom ∪ 𝐵)
37		fun2ssres 5361	. . . . . 6 ⊢ ((Fun recs(𝐺) ∧ ∪ 𝐵 ⊆ recs(𝐺) ∧ 𝑤 ⊆ dom ∪ 𝐵) → (recs(𝐺) ↾ 𝑤) = (∪ 𝐵 ↾ 𝑤))
38	24, 16, 36, 37	mp3an2ani 1378	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (recs(𝐺) ↾ 𝑤) = (∪ 𝐵 ↾ 𝑤))
39	38	fveq2d 5631	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (𝐺‘(recs(𝐺) ↾ 𝑤)) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
40	23, 28, 39	3eqtr3d 2270	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐷) → (∪ 𝐵‘𝑤) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
41	40	ralrimiva 2603	. 2 ⊢ (𝜑 → ∀𝑤 ∈ 𝐷 (∪ 𝐵‘𝑤) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
42		fveq2 5627	. . . 4 ⊢ (𝑢 = 𝑤 → (∪ 𝐵‘𝑢) = (∪ 𝐵‘𝑤))
43		reseq2 5000	. . . . 5 ⊢ (𝑢 = 𝑤 → (∪ 𝐵 ↾ 𝑢) = (∪ 𝐵 ↾ 𝑤))
44	43	fveq2d 5631	. . . 4 ⊢ (𝑢 = 𝑤 → (𝐺‘(∪ 𝐵 ↾ 𝑢)) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
45	42, 44	eqeq12d 2244	. . 3 ⊢ (𝑢 = 𝑤 → ((∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)) ↔ (∪ 𝐵‘𝑤) = (𝐺‘(∪ 𝐵 ↾ 𝑤))))
46	45	cbvralv 2765	. 2 ⊢ (∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)) ↔ ∀𝑤 ∈ 𝐷 (∪ 𝐵‘𝑤) = (𝐺‘(∪ 𝐵 ↾ 𝑤)))
47	41, 46	sylibr 134	1 ⊢ (𝜑 → ∀𝑢 ∈ 𝐷 (∪ 𝐵‘𝑢) = (𝐺‘(∪ 𝐵 ↾ 𝑢)))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1002   = wceq 1395  ∃wex 1538   ∈ wcel 2200  {cab 2215  ∀wral 2508  ∃wrex 2509  Vcvv 2799   ∪ cun 3195   ⊆ wss 3197  {csn 3666  ⟨cop 3669  ∪ cuni 3888  Ord word 4453  Oncon0 4454  suc csuc 4456  dom cdm 4719   ↾ cres 4721  Fun wfun 5312   Fn wfn 5313  ‘cfv 5318  recscrecs 6450

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-suc 4462  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-fv 5326  df-recs 6451

This theorem is referenced by:  tfr1onlemex  6493