Theorem tfr1onlemsucfn 6611

Description: We can extend an acceptable function by one element to produce a function. Lemma for tfr1on 6621. (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 2835	. 2 ⊢ (𝜑 → 𝑧 ∈ V)
3		fneq2 5470	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑓 Fn 𝑥 ↔ 𝑓 Fn 𝑧))
4	3	imbi1d 231	. . . . 5 ⊢ (𝑥 = 𝑧 → ((𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V) ↔ (𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V)))
5	4	albidv 1877	. . . 4 ⊢ (𝑥 = 𝑧 → (∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V) ↔ ∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V)))
6		tfr1on.ex	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋 ∧ 𝑓 Fn 𝑥) → (𝐺‘𝑓) ∈ V)
7	6	3expia 1236	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
8	7	alrimiv 1927	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
9	8	ralrimiva 2623	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑓(𝑓 Fn 𝑥 → (𝐺‘𝑓) ∈ V))
10	5, 9, 1	rspcdva 2934	. . 3 ⊢ (𝜑 → ∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V))
11		tfr1onlemsucfn.4	. . 3 ⊢ (𝜑 → 𝑔 Fn 𝑧)
12		fneq1 5469	. . . . 5 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝑧 ↔ 𝑔 Fn 𝑧))
13		fveq2 5695	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝐺‘𝑓) = (𝐺‘𝑔))
14	13	eleq1d 2307	. . . . 5 ⊢ (𝑓 = 𝑔 → ((𝐺‘𝑓) ∈ V ↔ (𝐺‘𝑔) ∈ V))
15	12, 14	imbi12d 234	. . . 4 ⊢ (𝑓 = 𝑔 → ((𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V) ↔ (𝑔 Fn 𝑧 → (𝐺‘𝑔) ∈ V)))
16	15	spv 1913	. . 3 ⊢ (∀𝑓(𝑓 Fn 𝑧 → (𝐺‘𝑓) ∈ V) → (𝑔 Fn 𝑧 → (𝐺‘𝑔) ∈ V))
17	10, 11, 16	sylc 62	. 2 ⊢ (𝜑 → (𝐺‘𝑔) ∈ V)
18		eqid 2238	. 2 ⊢ (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) = (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩})
19		df-suc 4516	. 2 ⊢ suc 𝑧 = (𝑧 ∪ {𝑧})
20		tfr1on.x	. . . 4 ⊢ (𝜑 → Ord 𝑋)
21		ordelon 4528	. . . 4 ⊢ ((Ord 𝑋 ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ On)
22	20, 1, 21	syl2anc 415	. . 3 ⊢ (𝜑 → 𝑧 ∈ On)
23		eloni 4520	. . 3 ⊢ (𝑧 ∈ On → Ord 𝑧)
24		ordirr 4689	. . 3 ⊢ (Ord 𝑧 → ¬ 𝑧 ∈ 𝑧)
25	22, 23, 24	3syl 17	. 2 ⊢ (𝜑 → ¬ 𝑧 ∈ 𝑧)
26	2, 17, 11, 18, 19, 25	fnunsn 5490	1 ⊢ (𝜑 → (𝑔 ∪ {⟨𝑧, (𝐺‘𝑔)⟩}) Fn suc 𝑧)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ∧ w3a 1009  ∀wal 1400   = wceq 1402   ∈ wcel 2209  {cab 2224  ∀wral 2528  ∃wrex 2529  Vcvv 2821   ∪ cun 3218  {csn 3709  ⟨cop 3712  Ord word 4507  Oncon0 4508  suc csuc 4510   ↾ cres 4776  Fun wfun 5371   Fn wfn 5372  ‘cfv 5377  recscrecs 6575

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385

This theorem is used by:  tfr1onlemsucaccv  6612  tfr1onlembfn  6615