Theorem tfrlemiex 6602

Description: Lemma for tfrlemi1 6603. (Contributed by Jim Kingdon, 18-Mar-2019.) (Proof shortened by Mario Carneiro, 24-May-2019.)

Hypotheses

Ref	Expression
tfrlemisucfn.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
tfrlemisucfn.2	⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))
tfrlemi1.3	⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))}
tfrlemi1.4	⊢ (𝜑 → 𝑥 ∈ On)
tfrlemi1.5	⊢ (𝜑 → ∀𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))))

Assertion

Ref	Expression
tfrlemiex	⊢ (𝜑 → ∃𝑓(𝑓 Fn 𝑥 ∧ ∀𝑢 ∈ 𝑥 (𝑓‘𝑢) = (𝐹‘(𝑓 ↾ 𝑢))))

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

Allowed substitution hints:   𝜑(𝑥, 𝑢, 𝑓)   𝐵(𝑥, 𝑦)

Proof of Theorem tfrlemiex

Step	Hyp	Ref	Expression
1		tfrlemisucfn.1	. . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
2		tfrlemisucfn.2	. . . 4 ⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))
3		tfrlemi1.3	. . . 4 ⊢ 𝐵 = {ℎ ∣ ∃𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ 𝑔 ∈ 𝐴 ∧ ℎ = (𝑔 ∪ {⟨𝑧, (𝐹‘𝑔)⟩}))}
4		tfrlemi1.4	. . . 4 ⊢ (𝜑 → 𝑥 ∈ On)
5		tfrlemi1.5	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝑥 ∃𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐹‘(𝑔 ↾ 𝑤))))
6	1, 2, 3, 4, 5	tfrlemibex 6600	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
7		uniexg 4585	. . 3 ⊢ (𝐵 ∈ V → ∪ 𝐵 ∈ V)
8	6, 7	syl 14	. 2 ⊢ (𝜑 → ∪ 𝐵 ∈ V)
9	1, 2, 3, 4, 5	tfrlemibfn 6599	. . 3 ⊢ (𝜑 → ∪ 𝐵 Fn 𝑥)
10	1, 2, 3, 4, 5	tfrlemiubacc 6601	. . 3 ⊢ (𝜑 → ∀𝑢 ∈ 𝑥 (∪ 𝐵‘𝑢) = (𝐹‘(∪ 𝐵 ↾ 𝑢)))
11	9, 10	jca 306	. 2 ⊢ (𝜑 → (∪ 𝐵 Fn 𝑥 ∧ ∀𝑢 ∈ 𝑥 (∪ 𝐵‘𝑢) = (𝐹‘(∪ 𝐵 ↾ 𝑢))))
12		fneq1 5469	. . . 4 ⊢ (𝑓 = ∪ 𝐵 → (𝑓 Fn 𝑥 ↔ ∪ 𝐵 Fn 𝑥))
13		fveq1 5694	. . . . . 6 ⊢ (𝑓 = ∪ 𝐵 → (𝑓‘𝑢) = (∪ 𝐵‘𝑢))
14		reseq1 5057	. . . . . . 7 ⊢ (𝑓 = ∪ 𝐵 → (𝑓 ↾ 𝑢) = (∪ 𝐵 ↾ 𝑢))
15	14	fveq2d 5699	. . . . . 6 ⊢ (𝑓 = ∪ 𝐵 → (𝐹‘(𝑓 ↾ 𝑢)) = (𝐹‘(∪ 𝐵 ↾ 𝑢)))
16	13, 15	eqeq12d 2253	. . . . 5 ⊢ (𝑓 = ∪ 𝐵 → ((𝑓‘𝑢) = (𝐹‘(𝑓 ↾ 𝑢)) ↔ (∪ 𝐵‘𝑢) = (𝐹‘(∪ 𝐵 ↾ 𝑢))))
17	16	ralbidv 2550	. . . 4 ⊢ (𝑓 = ∪ 𝐵 → (∀𝑢 ∈ 𝑥 (𝑓‘𝑢) = (𝐹‘(𝑓 ↾ 𝑢)) ↔ ∀𝑢 ∈ 𝑥 (∪ 𝐵‘𝑢) = (𝐹‘(∪ 𝐵 ↾ 𝑢))))
18	12, 17	anbi12d 477	. . 3 ⊢ (𝑓 = ∪ 𝐵 → ((𝑓 Fn 𝑥 ∧ ∀𝑢 ∈ 𝑥 (𝑓‘𝑢) = (𝐹‘(𝑓 ↾ 𝑢))) ↔ (∪ 𝐵 Fn 𝑥 ∧ ∀𝑢 ∈ 𝑥 (∪ 𝐵‘𝑢) = (𝐹‘(∪ 𝐵 ↾ 𝑢)))))
19	18	spcegv 2913	. 2 ⊢ (∪ 𝐵 ∈ V → ((∪ 𝐵 Fn 𝑥 ∧ ∀𝑢 ∈ 𝑥 (∪ 𝐵‘𝑢) = (𝐹‘(∪ 𝐵 ↾ 𝑢))) → ∃𝑓(𝑓 Fn 𝑥 ∧ ∀𝑢 ∈ 𝑥 (𝑓‘𝑢) = (𝐹‘(𝑓 ↾ 𝑢)))))
20	8, 11, 19	sylc 62	1 ⊢ (𝜑 → ∃𝑓(𝑓 Fn 𝑥 ∧ ∀𝑢 ∈ 𝑥 (𝑓‘𝑢) = (𝐹‘(𝑓 ↾ 𝑢))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009  ∀wal 1400   = wceq 1402  ∃wex 1545   ∈ wcel 2209  {cab 2224  ∀wral 2528  ∃wrex 2529  Vcvv 2821   ∪ cun 3218  {csn 3709  ⟨cop 3712  ∪ cuni 3935  Oncon0 4508   ↾ cres 4776  Fun wfun 5371   Fn wfn 5372  ‘cfv 5377

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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  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-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  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-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-recs 6576

This theorem is used by:  tfrlemi1  6603