Theorem tfrcllemssrecs 6320

Description: Lemma for tfrcl 6332. The union of functions acceptable for tfrcl 6332 is a subset of recs. (Contributed by Jim Kingdon, 25-Mar-2022.)

Hypotheses

Ref	Expression
tfrcllemssrecs.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
tfrcllemssrecs.x	⊢ (𝜑 → Ord 𝑋)

Assertion

Ref	Expression
tfrcllemssrecs	⊢ (𝜑 → ∪ 𝐴 ⊆ recs(𝐺))

Distinct variable groups:   𝑓,𝐺,𝑥,𝑦   𝑥,𝑋   𝜑,𝑓

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥,𝑦,𝑓)   𝑆(𝑥,𝑦,𝑓)   𝑋(𝑦,𝑓)

Proof of Theorem tfrcllemssrecs

Step	Hyp	Ref	Expression
1		tfrcllemssrecs.1	. . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
2		tfrcllemssrecs.x	. . . . . 6 ⊢ (𝜑 → Ord 𝑋)
3		ordsson 4469	. . . . . 6 ⊢ (Ord 𝑋 → 𝑋 ⊆ On)
4		ssrexv 3207	. . . . . 6 ⊢ (𝑋 ⊆ On → (∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) → ∃𝑥 ∈ On (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))))
5	2, 3, 4	3syl 17	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) → ∃𝑥 ∈ On (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))))
6	5	ss2abdv 3215	. . . 4 ⊢ (𝜑 → {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} ⊆ {𝑓 ∣ ∃𝑥 ∈ On (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))})
7	1, 6	eqsstrid 3188	. . 3 ⊢ (𝜑 → 𝐴 ⊆ {𝑓 ∣ ∃𝑥 ∈ On (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))})
8	7	unissd 3813	. 2 ⊢ (𝜑 → ∪ 𝐴 ⊆ ∪ {𝑓 ∣ ∃𝑥 ∈ On (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))})
9		ffn 5337	. . . . . . 7 ⊢ (𝑓:𝑥⟶𝑆 → 𝑓 Fn 𝑥)
10	9	anim1i 338	. . . . . 6 ⊢ ((𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) → (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))))
11	10	reximi 2563	. . . . 5 ⊢ (∃𝑥 ∈ On (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) → ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))))
12	11	ss2abi 3214	. . . 4 ⊢ {𝑓 ∣ ∃𝑥 ∈ On (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} ⊆ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
13	12	unissi 3812	. . 3 ⊢ ∪ {𝑓 ∣ ∃𝑥 ∈ On (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} ⊆ ∪ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
14		df-recs 6273	. . 3 ⊢ recs(𝐺) = ∪ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
15	13, 14	sseqtrri 3177	. 2 ⊢ ∪ {𝑓 ∣ ∃𝑥 ∈ On (𝑓:𝑥⟶𝑆 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} ⊆ recs(𝐺)
16	8, 15	sstrdi 3154	1 ⊢ (𝜑 → ∪ 𝐴 ⊆ recs(𝐺))

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1343  {cab 2151  ∀wral 2444  ∃wrex 2445   ⊆ wss 3116  ∪ cuni 3789  Ord word 4340  Oncon0 4341   ↾ cres 4606   Fn wfn 5183  ⟶wf 5184  ‘cfv 5188  recscrecs 6272

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-in 3122  df-ss 3129  df-uni 3790  df-tr 4081  df-iord 4344  df-on 4346  df-f 5192  df-recs 6273

This theorem is referenced by:  tfrcllembfn  6325  tfrcllemubacc  6327  tfrcllemres  6330