Theorem frecfcllem 6648

Description: Lemma for frecfcl 6649. Just giving a name to a common expression to simplify the proof. (Contributed by Jim Kingdon, 30-Mar-2022.)

Hypothesis

Ref	Expression
frecfcllem.g	⊢ 𝐺 = recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))}))

Assertion

Ref	Expression
frecfcllem	⊢ ((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → frec(𝐹, 𝐴):ω⟶𝑆)

Distinct variable groups:   𝐴,𝑔,𝑚,𝑥   𝑔,𝐹,𝑚,𝑥   𝑧,𝐹,𝑚,𝑥   𝑆,𝑚,𝑥,𝑧

Allowed substitution hints:   𝐴(𝑧)   𝑆(𝑔)   𝐺(𝑥,𝑧,𝑔,𝑚)

Proof of Theorem frecfcllem

Dummy variables 𝑓 𝑦 𝑘 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		frecfcllem.g	. . . . . 6 ⊢ 𝐺 = recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))}))
2		funmpt 5395	. . . . . . 7 ⊢ Fun (𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))})
3	2	a1i 9	. . . . . 6 ⊢ (((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) → Fun (𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))}))
4		ordom 4734	. . . . . . 7 ⊢ Ord ω
5	4	a1i 9	. . . . . 6 ⊢ (((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) → Ord ω)
6		vex 2818	. . . . . . . 8 ⊢ 𝑓 ∈ V
7		simp2 1025	. . . . . . . . 9 ⊢ ((((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) ∧ 𝑦 ∈ ω ∧ 𝑓:𝑦⟶𝑆) → 𝑦 ∈ ω)
8		simp3 1026	. . . . . . . . 9 ⊢ ((((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) ∧ 𝑦 ∈ ω ∧ 𝑓:𝑦⟶𝑆) → 𝑓:𝑦⟶𝑆)
9		simp1ll 1087	. . . . . . . . . 10 ⊢ ((((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) ∧ 𝑦 ∈ ω ∧ 𝑓:𝑦⟶𝑆) → ∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆)
10		fveq2 5675	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝐹‘𝑧) = (𝐹‘𝑤))
11	10	eleq1d 2303	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → ((𝐹‘𝑧) ∈ 𝑆 ↔ (𝐹‘𝑤) ∈ 𝑆))
12	11	cbvralv 2780	. . . . . . . . . 10 ⊢ (∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ↔ ∀𝑤 ∈ 𝑆 (𝐹‘𝑤) ∈ 𝑆)
13	9, 12	sylib 122	. . . . . . . . 9 ⊢ ((((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) ∧ 𝑦 ∈ ω ∧ 𝑓:𝑦⟶𝑆) → ∀𝑤 ∈ 𝑆 (𝐹‘𝑤) ∈ 𝑆)
14		simp1lr 1088	. . . . . . . . 9 ⊢ ((((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) ∧ 𝑦 ∈ ω ∧ 𝑓:𝑦⟶𝑆) → 𝐴 ∈ 𝑆)
15	7, 8, 13, 14	frecabcl 6643	. . . . . . . 8 ⊢ ((((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) ∧ 𝑦 ∈ ω ∧ 𝑓:𝑦⟶𝑆) → {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑓‘𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥 ∈ 𝐴))} ∈ 𝑆)
16		dmeq 4961	. . . . . . . . . . . . . 14 ⊢ (𝑔 = 𝑓 → dom 𝑔 = dom 𝑓)
17	16	eqeq1d 2243	. . . . . . . . . . . . 13 ⊢ (𝑔 = 𝑓 → (dom 𝑔 = suc 𝑚 ↔ dom 𝑓 = suc 𝑚))
18		fveq1 5674	. . . . . . . . . . . . . . 15 ⊢ (𝑔 = 𝑓 → (𝑔‘𝑚) = (𝑓‘𝑚))
19	18	fveq2d 5679	. . . . . . . . . . . . . 14 ⊢ (𝑔 = 𝑓 → (𝐹‘(𝑔‘𝑚)) = (𝐹‘(𝑓‘𝑚)))
20	19	eleq2d 2304	. . . . . . . . . . . . 13 ⊢ (𝑔 = 𝑓 → (𝑥 ∈ (𝐹‘(𝑔‘𝑚)) ↔ 𝑥 ∈ (𝐹‘(𝑓‘𝑚))))
21	17, 20	anbi12d 473	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑓 → ((dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ↔ (dom 𝑓 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑓‘𝑚)))))
22	21	rexbidv 2545	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑓 → (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ↔ ∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑓‘𝑚)))))
23	16	eqeq1d 2243	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑓 → (dom 𝑔 = ∅ ↔ dom 𝑓 = ∅))
24	23	anbi1d 465	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑓 → ((dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴) ↔ (dom 𝑓 = ∅ ∧ 𝑥 ∈ 𝐴)))
25	22, 24	orbi12d 801	. . . . . . . . . 10 ⊢ (𝑔 = 𝑓 → ((∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴)) ↔ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑓‘𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥 ∈ 𝐴))))
26	25	abbidv 2354	. . . . . . . . 9 ⊢ (𝑔 = 𝑓 → {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))} = {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑓‘𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥 ∈ 𝐴))})
27		eqid 2234	. . . . . . . . 9 ⊢ (𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))}) = (𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))})
28	26, 27	fvmptg 5758	. . . . . . . 8 ⊢ ((𝑓 ∈ V ∧ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑓‘𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥 ∈ 𝐴))} ∈ 𝑆) → ((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))})‘𝑓) = {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑓‘𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥 ∈ 𝐴))})
29	6, 15, 28	sylancr 414	. . . . . . 7 ⊢ ((((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) ∧ 𝑦 ∈ ω ∧ 𝑓:𝑦⟶𝑆) → ((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))})‘𝑓) = {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑓 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑓‘𝑚))) ∨ (dom 𝑓 = ∅ ∧ 𝑥 ∈ 𝐴))})
30	29, 15	eqeltrd 2311	. . . . . 6 ⊢ ((((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) ∧ 𝑦 ∈ ω ∧ 𝑓:𝑦⟶𝑆) → ((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))})‘𝑓) ∈ 𝑆)
31		limom 4741	. . . . . . . . . 10 ⊢ Lim ω
32		limuni 4522	. . . . . . . . . 10 ⊢ (Lim ω → ω = ∪ ω)
33	31, 32	ax-mp 5	. . . . . . . . 9 ⊢ ω = ∪ ω
34	33	eleq2i 2301	. . . . . . . 8 ⊢ (𝑦 ∈ ω ↔ 𝑦 ∈ ∪ ω)
35		peano2 4722	. . . . . . . 8 ⊢ (𝑦 ∈ ω → suc 𝑦 ∈ ω)
36	34, 35	sylbir 135	. . . . . . 7 ⊢ (𝑦 ∈ ∪ ω → suc 𝑦 ∈ ω)
37	36	adantl 277	. . . . . 6 ⊢ ((((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) ∧ 𝑦 ∈ ∪ ω) → suc 𝑦 ∈ ω)
38	33	eleq2i 2301	. . . . . . . 8 ⊢ (𝑘 ∈ ω ↔ 𝑘 ∈ ∪ ω)
39	38	biimpi 120	. . . . . . 7 ⊢ (𝑘 ∈ ω → 𝑘 ∈ ∪ ω)
40	39	adantl 277	. . . . . 6 ⊢ (((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) → 𝑘 ∈ ∪ ω)
41	1, 3, 5, 30, 37, 40	tfrcldm 6607	. . . . 5 ⊢ (((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) → 𝑘 ∈ dom 𝐺)
42	1, 3, 5, 30, 37, 40	tfrcl 6608	. . . . 5 ⊢ (((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) → (𝐺‘𝑘) ∈ 𝑆)
43	41, 42	jca 306	. . . 4 ⊢ (((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) ∧ 𝑘 ∈ ω) → (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑆))
44	43	ralrimiva 2617	. . 3 ⊢ ((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → ∀𝑘 ∈ ω (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑆))
45		tfrfun 6564	. . . . 5 ⊢ Fun recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))}))
46	1	funeqi 5378	. . . . 5 ⊢ (Fun 𝐺 ↔ Fun recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))})))
47	45, 46	mpbir 146	. . . 4 ⊢ Fun 𝐺
48		ffvresb 5845	. . . 4 ⊢ (Fun 𝐺 → ((𝐺 ↾ ω):ω⟶𝑆 ↔ ∀𝑘 ∈ ω (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑆)))
49	47, 48	ax-mp 5	. . 3 ⊢ ((𝐺 ↾ ω):ω⟶𝑆 ↔ ∀𝑘 ∈ ω (𝑘 ∈ dom 𝐺 ∧ (𝐺‘𝑘) ∈ 𝑆))
50	44, 49	sylibr 134	. 2 ⊢ ((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (𝐺 ↾ ω):ω⟶𝑆)
51		df-frec 6635	. . . 4 ⊢ frec(𝐹, 𝐴) = (recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))})) ↾ ω)
52	1	reseq1i 5039	. . . 4 ⊢ (𝐺 ↾ ω) = (recs((𝑔 ∈ V ↦ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑔 = suc 𝑚 ∧ 𝑥 ∈ (𝐹‘(𝑔‘𝑚))) ∨ (dom 𝑔 = ∅ ∧ 𝑥 ∈ 𝐴))})) ↾ ω)
53	51, 52	eqtr4i 2258	. . 3 ⊢ frec(𝐹, 𝐴) = (𝐺 ↾ ω)
54	53	feq1i 5506	. 2 ⊢ (frec(𝐹, 𝐴):ω⟶𝑆 ↔ (𝐺 ↾ ω):ω⟶𝑆)
55	50, 54	sylibr 134	1 ⊢ ((∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → frec(𝐹, 𝐴):ω⟶𝑆)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 716   ∧ w3a 1005   = wceq 1398   ∈ wcel 2205  {cab 2220  ∀wral 2522  ∃wrex 2523  Vcvv 2815  ∅c0 3512  ∪ cuni 3919   ↦ cmpt 4176  Ord word 4488  Lim wlim 4490  suc csuc 4491  ωcom 4717  dom cdm 4754   ↾ cres 4756  Fun wfun 5351  ⟶wf 5353  ‘cfv 5357  recscrecs 6548  freccfrec 6634

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-recs 6549  df-frec 6635

This theorem is referenced by:  frecfcl  6649