Theorem frrlem8 8293

Description: Lemma for well-founded recursion. dom 𝐹 is closed under predecessor classes. (Contributed by Scott Fenton, 6-Dec-2022.)

Hypotheses

Ref	Expression
frrlem5.1	⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
frrlem5.2	⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺)

Assertion

Ref	Expression
frrlem8	⊢ (𝑧 ∈ dom 𝐹 → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝐹)

Distinct variable groups:   𝐴,𝑓,𝑥,𝑦   𝑓,𝐺,𝑥,𝑦   𝑅,𝑓,𝑥,𝑦   𝑦,𝐹   𝑧,𝐴,𝑓,𝑥,𝑦   𝑧,𝑅   𝑧,𝐺

Allowed substitution hints:   𝐵(𝑥, 𝑦, 𝑧, 𝑓)   𝐹(𝑥, 𝑧, 𝑓)

Proof of Theorem frrlem8

Dummy variables 𝑔 𝑎 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3454	. . 3 ⊢ 𝑧 ∈ V
2	1	eldm2 5885	. 2 ⊢ (𝑧 ∈ dom 𝐹 ↔ ∃𝑤⟨𝑧, 𝑤⟩ ∈ 𝐹)
3		frrlem5.1	. . . . . . . 8 ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
4		frrlem5.2	. . . . . . . 8 ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺)
5	3, 4	frrlem5 8290	. . . . . . 7 ⊢ 𝐹 = ∪ 𝐵
6	3	frrlem1 8286	. . . . . . . 8 ⊢ 𝐵 = {𝑔 ∣ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))}
7	6	unieqi 4879	. . . . . . 7 ⊢ ∪ 𝐵 = ∪ {𝑔 ∣ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))}
8	5, 7	eqtri 2783	. . . . . 6 ⊢ 𝐹 = ∪ {𝑔 ∣ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))}
9	8	eleq2i 2852	. . . . 5 ⊢ (⟨𝑧, 𝑤⟩ ∈ 𝐹 ↔ ⟨𝑧, 𝑤⟩ ∈ ∪ {𝑔 ∣ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))})
10		eluniab 4881	. . . . 5 ⊢ (⟨𝑧, 𝑤⟩ ∈ ∪ {𝑔 ∣ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))} ↔ ∃𝑔(⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))))
11	9, 10	bitri 278	. . . 4 ⊢ (⟨𝑧, 𝑤⟩ ∈ 𝐹 ↔ ∃𝑔(⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))))
12		simpr2r 1252	. . . . . . . . . . 11 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎)
13		vex 3454	. . . . . . . . . . . . . 14 ⊢ 𝑤 ∈ V
14	1, 13	opeldm 5891	. . . . . . . . . . . . 13 ⊢ (⟨𝑧, 𝑤⟩ ∈ 𝑔 → 𝑧 ∈ dom 𝑔)
15	14	adantr 486	. . . . . . . . . . . 12 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → 𝑧 ∈ dom 𝑔)
16		simpr1 1213	. . . . . . . . . . . . 13 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → 𝑔 Fn 𝑎)
17	16	fndmd 6638	. . . . . . . . . . . 12 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → dom 𝑔 = 𝑎)
18	15, 17	eleqtrd 2862	. . . . . . . . . . 11 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → 𝑧 ∈ 𝑎)
19		rsp 3250	. . . . . . . . . . 11 ⊢ (∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎 → (𝑧 ∈ 𝑎 → Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎))
20	12, 18, 19	sylc 66	. . . . . . . . . 10 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎)
21	20, 17	sseqtrrd 3968	. . . . . . . . 9 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝑔)
22		19.8a 2217	. . . . . . . . . . . . . 14 ⊢ ((𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧)))) → ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧)))))
23	6	eqabri 2902	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ 𝐵 ↔ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧)))))
24	22, 23	sylibr 237	. . . . . . . . . . . . 13 ⊢ ((𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧)))) → 𝑔 ∈ 𝐵)
25	24	adantl 487	. . . . . . . . . . . 12 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → 𝑔 ∈ 𝐵)
26		elssuni 4899	. . . . . . . . . . . 12 ⊢ (𝑔 ∈ 𝐵 → 𝑔 ⊆ ∪ 𝐵)
27	25, 26	syl 18	. . . . . . . . . . 11 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → 𝑔 ⊆ ∪ 𝐵)
28	27, 5	sseqtrrdi 3972	. . . . . . . . . 10 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → 𝑔 ⊆ 𝐹)
29		dmss 5886	. . . . . . . . . 10 ⊢ (𝑔 ⊆ 𝐹 → dom 𝑔 ⊆ dom 𝐹)
30	28, 29	syl 18	. . . . . . . . 9 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → dom 𝑔 ⊆ dom 𝐹)
31	21, 30	sstrd 3941	. . . . . . . 8 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ (𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝐹)
32	31	expcom 419	. . . . . . 7 ⊢ ((𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (⟨𝑧, 𝑤⟩ ∈ 𝑔 → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝐹))
33	32	exlimiv 1963	. . . . . 6 ⊢ (∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧)))) → (⟨𝑧, 𝑤⟩ ∈ 𝑔 → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝐹))
34	33	impcom 413	. . . . 5 ⊢ ((⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝐹)
35	34	exlimiv 1963	. . . 4 ⊢ (∃𝑔(⟨𝑧, 𝑤⟩ ∈ 𝑔 ∧ ∃𝑎(𝑔 Fn 𝑎 ∧ (𝑎 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑎 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑎) ∧ ∀𝑧 ∈ 𝑎 (𝑔‘𝑧) = (𝑧𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑧))))) → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝐹)
36	11, 35	sylbi 220	. . 3 ⊢ (⟨𝑧, 𝑤⟩ ∈ 𝐹 → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝐹)
37	36	exlimiv 1963	. 2 ⊢ (∃𝑤⟨𝑧, 𝑤⟩ ∈ 𝐹 → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝐹)
38	2, 37	sylbi 220	1 ⊢ (𝑧 ∈ dom 𝐹 → Pred(𝑅, 𝐴, 𝑧) ⊆ dom 𝐹)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2738  ∀wral 3076   ⊆ wss 3899  ⟨cop 4590  ∪ cuni 4867  dom cdm 5655   ↾ cres 5657  Predcpred 6298   Fn wfn 6528  ‘cfv 6533  (class class class)co 7414  frecscfrecs 8280

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541  df-ov 7417  df-frecs 8281

This theorem is used by:  frrlem12  8297  frrlem13  8298  frrdmcl  8308