Theorem tfrcllembacc 6204

Description: Lemma for tfrcl 6213. Each element of 𝐵 is an acceptable function. (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
tfrcllembacc	⊢ (𝜑 → 𝐵 ⊆ 𝐴)

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

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

Proof of Theorem tfrcllembacc

Step	Hyp	Ref	Expression
1		tfrcllembacc.3	. 2 ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))}
2		simpr3 970	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))
3		tfrcl.f	. . . . . . . 8 ⊢ 𝐹 = recs(𝐺)
4		tfrcl.g	. . . . . . . . 9 ⊢ (𝜑 → Fun 𝐺)
5	4	ad2antrr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → Fun 𝐺)
6		tfrcl.x	. . . . . . . . 9 ⊢ (𝜑 → Ord 𝑋)
7	6	ad2antrr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → Ord 𝑋)
8		simp1ll 1025	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → 𝜑)
9		tfrcl.ex	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆)
10	8, 9	syld3an1 1243	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) ∧ 𝑥 ∈ 𝑋 ∧ 𝑓:𝑥⟶𝑆) → (𝐺‘𝑓) ∈ 𝑆)
11		tfrcllemsucfn.1	. . . . . . . 8 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
12		tfrcllembacc.4	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ 𝑋)
13	12	ad2antrr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝐷 ∈ 𝑋)
14		simplr 502	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑧 ∈ 𝐷)
15		tfrcllembacc.u	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
16	15	adantlr 466	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
17	16	adantlr 466	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) ∧ 𝑥 ∈ ∪ 𝑋) → suc 𝑥 ∈ 𝑋)
18		simpr1 968	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑔:𝑧⟶𝑆)
19		simpr2 969	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → 𝑔 ∈ 𝐴)
20	3, 5, 7, 10, 11, 13, 14, 17, 18, 19	tfrcllemsucaccv 6203	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) ∈ 𝐴)
21	2, 20	eqeltrd 2189	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐷) ∧ (𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))) → ℎ ∈ 𝐴)
22	21	ex 114	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → ((𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ℎ ∈ 𝐴))
23	22	exlimdv 1771	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐷) → (∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ℎ ∈ 𝐴))
24	23	rexlimdva 2521	. . 3 ⊢ (𝜑 → (∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})) → ℎ ∈ 𝐴))
25	24	abssdv 3135	. 2 ⊢ (𝜑 → {ℎ ∣ ∃𝑧 ∈ 𝐷 ∃𝑔(𝑔:𝑧⟶𝑆 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}))} ⊆ 𝐴)
26	1, 25	syl5eqss 3107	1 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)

Syntax hints:   → wi 4   ∧ wa 103   ∧ w3a 943   = wceq 1312  ∃wex 1449   ∈ wcel 1461  {cab 2099  ∀wral 2388  ∃wrex 2389   ∪ cun 3033   ⊆ wss 3035  {csn 3491  ⟨cop 3494  ∪ cuni 3700  Ord word 4242  suc csuc 4245   ↾ cres 4499  Fun wfun 5073  ⟶wf 5075  ‘cfv 5079  recscrecs 6153

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1404  ax-7 1405  ax-gen 1406  ax-ie1 1450  ax-ie2 1451  ax-8 1463  ax-10 1464  ax-11 1465  ax-i12 1466  ax-bndl 1467  ax-4 1468  ax-13 1472  ax-14 1473  ax-17 1487  ax-i9 1491  ax-ial 1495  ax-i5r 1496  ax-ext 2095  ax-sep 4004  ax-pow 4056  ax-pr 4089  ax-un 4313  ax-setind 4410

This theorem depends on definitions:  df-bi 116  df-3an 945  df-tru 1315  df-fal 1318  df-nf 1418  df-sb 1717  df-eu 1976  df-mo 1977  df-clab 2100  df-cleq 2106  df-clel 2109  df-nfc 2242  df-ne 2281  df-ral 2393  df-rex 2394  df-v 2657  df-sbc 2877  df-dif 3037  df-un 3039  df-in 3041  df-ss 3048  df-nul 3328  df-pw 3476  df-sn 3497  df-pr 3498  df-op 3500  df-uni 3701  df-br 3894  df-opab 3948  df-tr 3985  df-id 4173  df-iord 4246  df-on 4248  df-suc 4251  df-xp 4503  df-rel 4504  df-cnv 4505  df-co 4506  df-dm 4507  df-rn 4508  df-res 4509  df-iota 5044  df-fun 5081  df-fn 5082  df-f 5083  df-f1 5084  df-fo 5085  df-f1o 5086  df-fv 5087

This theorem is referenced by:  tfrcllembfn  6206  tfrcllemubacc  6208