Theorem tfr1onlemsucfn 6501

Description: We can extend an acceptable function by one element to produce a function. Lemma for tfr1on 6511. (Contributed by Jim Kingdon, 12-Mar-2022.)

Hypotheses

Ref	Expression
tfr1on.f	⊢ 𝐹 = recs(𝐺)
tfr1on.g	⊢ (𝜑 → Fun 𝐺)
tfr1on.x	⊢ (𝜑 → Ord 𝑋)
tfr1on.ex	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V)
tfr1onlemsucfn.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
tfr1onlemsucfn.3	⊢ (𝜑 → 𝑧 ∈ 𝑋)
tfr1onlemsucfn.4	⊢ (𝜑 → 𝑔 Fn 𝑧)
tfr1onlemsucfn.5	⊢ (𝜑 → 𝑔 ∈ 𝐴)

Assertion

Ref	Expression
tfr1onlemsucfn	⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧)

Distinct variable groups:   𝑓,𝐺,𝑥   𝑓,𝑋,𝑥   𝑓,𝑔   𝜑,𝑓,𝑥   𝑧,𝑓,𝑥

Allowed substitution hints:   𝜑(𝑦,𝑧,𝑔)   𝐴(𝑥,𝑦,𝑧,𝑓,𝑔)   𝐹(𝑥,𝑦,𝑧,𝑓,𝑔)   𝐺(𝑦,𝑧,𝑔)   𝑋(𝑦,𝑧,𝑔)

Proof of Theorem tfr1onlemsucfn

Step	Hyp	Ref	Expression
1		tfr1onlemsucfn.3	. . 3 ⊢ (𝜑 → 𝑧 ∈ 𝑋)
2	1	elexd 2814	. 2 ⊢ (𝜑 → 𝑧 ∈ V)
3		fneq2 5416	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑓 Fn 𝑥 ↔ 𝑓 Fn 𝑧))
4	3	imbi1d 231	. . . . 5 ⊢ (𝑥 = 𝑧 → ((𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V) ↔ (𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V)))
5	4	albidv 1870	. . . 4 ⊢ (𝑥 = 𝑧 → (∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V) ↔ ∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V)))
6		tfr1on.ex	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V)
7	6	3expia 1229	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
8	7	alrimiv 1920	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
9	8	ralrimiva 2603	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
10	5, 9, 1	rspcdva 2913	. . 3 ⊢ (𝜑 → ∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V))
11		tfr1onlemsucfn.4	. . 3 ⊢ (𝜑 → 𝑔 Fn 𝑧)
12		fneq1 5415	. . . . 5 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝑧 ↔ 𝑔 Fn 𝑧))
13		fveq2 5635	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝐺‘𝑓) = (𝐺‘𝑔))
14	13	eleq1d 2298	. . . . 5 ⊢ (𝑓 = 𝑔 → ((𝐺‘𝑓) ∈ V ↔ (𝐺‘𝑔) ∈ V))
15	12, 14	imbi12d 234	. . . 4 ⊢ (𝑓 = 𝑔 → ((𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V) ↔ (𝑔 Fn 𝑧 → (𝐺‘𝑔) ∈ V)))
16	15	spv 1906	. . 3 ⊢ (∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V) → (𝑔 Fn 𝑧 → (𝐺‘𝑔) ∈ V))
17	10, 11, 16	sylc 62	. 2 ⊢ (𝜑 → (𝐺‘𝑔) ∈ V)
18		eqid 2229	. 2 ⊢ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})
19		df-suc 4466	. 2 ⊢ suc 𝑧 = (𝑧 ∪ {𝑧})
20		tfr1on.x	. . . 4 ⊢ (𝜑 → Ord 𝑋)
21		ordelon 4478	. . . 4 ⊢ ((Ord 𝑋 ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ On)
22	20, 1, 21	syl2anc 411	. . 3 ⊢ (𝜑 → 𝑧 ∈ On)
23		eloni 4470	. . 3 ⊢ (𝑧 ∈ On → Ord 𝑧)
24		ordirr 4638	. . 3 ⊢ (Ord 𝑧 → ¬ 𝑧 ∈ 𝑧)
25	22, 23, 24	3syl 17	. 2 ⊢ (𝜑 → ¬ 𝑧 ∈ 𝑧)
26	2, 17, 11, 18, 19, 25	fnunsn 5436	1 ⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∧ w3a 1002  ∀wal 1393   = wceq 1395   ∈ wcel 2200  {cab 2215  ∀wral 2508  ∃wrex 2509  Vcvv 2800   ∪ cun 3196  {csn 3667  ⟨cop 3670  Ord word 4457  Oncon0 4458  suc csuc 4460   ↾ cres 4725  Fun wfun 5318   Fn wfn 5319  ‘cfv 5324  recscrecs 6465

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-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-setind 4633

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-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fn 5327  df-fv 5332

This theorem is referenced by:  tfr1onlemsucaccv  6502  tfr1onlembfn  6505