Theorem tfrlem9 5857

Description: Lemma for transfinite recursion. Here we compute the value of recs (the union of all acceptable functions). (Contributed by NM, 17-Aug-1994.)

Hypothesis

Ref	Expression
tfrlem.1	⊢ A = {f ∣ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))}

Assertion

Ref	Expression
tfrlem9	⊢ (B ∈ dom recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))

Distinct variable groups:   x,f,y,B   f,𝐹,x,y

Allowed substitution hints:   A(x,y,f)

Proof of Theorem tfrlem9

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldm2g 4458	. . 3 ⊢ (B ∈ dom recs(𝐹) → (B ∈ dom recs(𝐹) ↔ ∃z⟨B, z⟩ ∈ recs(𝐹)))
2	1	ibi 165	. 2 ⊢ (B ∈ dom recs(𝐹) → ∃z⟨B, z⟩ ∈ recs(𝐹))
3		df-recs 5842	. . . . . 6 ⊢ recs(𝐹) = ∪ {f ∣ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))}
4	3	eleq2i 2086	. . . . 5 ⊢ (⟨B, z⟩ ∈ recs(𝐹) ↔ ⟨B, z⟩ ∈ ∪ {f ∣ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))})
5		eluniab 3566	. . . . 5 ⊢ (⟨B, z⟩ ∈ ∪ {f ∣ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))} ↔ ∃f(⟨B, z⟩ ∈ f ∧ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))))
6	4, 5	bitri 173	. . . 4 ⊢ (⟨B, z⟩ ∈ recs(𝐹) ↔ ∃f(⟨B, z⟩ ∈ f ∧ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))))
7		fnop 4928	. . . . . . . . . . . . . 14 ⊢ ((f Fn x ∧ ⟨B, z⟩ ∈ f) → B ∈ x)
8		rspe 2348	. . . . . . . . . . . . . . . 16 ⊢ ((x ∈ On ∧ (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))) → ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y))))
9		tfrlem.1	. . . . . . . . . . . . . . . . . 18 ⊢ A = {f ∣ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))}
10	9	abeq2i 2130	. . . . . . . . . . . . . . . . 17 ⊢ (f ∈ A ↔ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y))))
11		elssuni 3582	. . . . . . . . . . . . . . . . . 18 ⊢ (f ∈ A → f ⊆ ∪ A)
12	9	recsfval 5853	. . . . . . . . . . . . . . . . . 18 ⊢ recs(𝐹) = ∪ A
13	11, 12	syl6sseqr 2969	. . . . . . . . . . . . . . . . 17 ⊢ (f ∈ A → f ⊆ recs(𝐹))
14	10, 13	sylbir 125	. . . . . . . . . . . . . . . 16 ⊢ (∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y))) → f ⊆ recs(𝐹))
15	8, 14	syl 14	. . . . . . . . . . . . . . 15 ⊢ ((x ∈ On ∧ (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))) → f ⊆ recs(𝐹))
16		fveq2 5103	. . . . . . . . . . . . . . . . . . . 20 ⊢ (y = B → (f‘y) = (f‘B))
17		reseq2 4534	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (y = B → (f ↾ y) = (f ↾ B))
18	17	fveq2d 5107	. . . . . . . . . . . . . . . . . . . 20 ⊢ (y = B → (𝐹‘(f ↾ y)) = (𝐹‘(f ↾ B)))
19	16, 18	eqeq12d 2036	. . . . . . . . . . . . . . . . . . 19 ⊢ (y = B → ((f‘y) = (𝐹‘(f ↾ y)) ↔ (f‘B) = (𝐹‘(f ↾ B))))
20	19	rspcv 2629	. . . . . . . . . . . . . . . . . 18 ⊢ (B ∈ x → (∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)) → (f‘B) = (𝐹‘(f ↾ B))))
21		fndm 4924	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (f Fn x → dom f = x)
22	21	eleq2d 2089	. . . . . . . . . . . . . . . . . . . 20 ⊢ (f Fn x → (B ∈ dom f ↔ B ∈ x))
23	9	tfrlem7 5855	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ Fun recs(𝐹)
24		funssfv 5124	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((Fun recs(𝐹) ∧ f ⊆ recs(𝐹) ∧ B ∈ dom f) → (recs(𝐹)‘B) = (f‘B))
25	23, 24	mp3an1 1204	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((f ⊆ recs(𝐹) ∧ B ∈ dom f) → (recs(𝐹)‘B) = (f‘B))
26	25	adantrl 450	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((f ⊆ recs(𝐹) ∧ ((f Fn x ∧ x ∈ On) ∧ B ∈ dom f)) → (recs(𝐹)‘B) = (f‘B))
27	21	eleq1d 2088	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (f Fn x → (dom f ∈ On ↔ x ∈ On))
28		onelss 4073	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (dom f ∈ On → (B ∈ dom f → B ⊆ dom f))
29	27, 28	syl6bir 153	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (f Fn x → (x ∈ On → (B ∈ dom f → B ⊆ dom f)))
30	29	imp31 243	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((f Fn x ∧ x ∈ On) ∧ B ∈ dom f) → B ⊆ dom f)
31		fun2ssres 4869	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((Fun recs(𝐹) ∧ f ⊆ recs(𝐹) ∧ B ⊆ dom f) → (recs(𝐹) ↾ B) = (f ↾ B))
32	31	fveq2d 5107	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((Fun recs(𝐹) ∧ f ⊆ recs(𝐹) ∧ B ⊆ dom f) → (𝐹‘(recs(𝐹) ↾ B)) = (𝐹‘(f ↾ B)))
33	23, 32	mp3an1 1204	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((f ⊆ recs(𝐹) ∧ B ⊆ dom f) → (𝐹‘(recs(𝐹) ↾ B)) = (𝐹‘(f ↾ B)))
34	30, 33	sylan2 270	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((f ⊆ recs(𝐹) ∧ ((f Fn x ∧ x ∈ On) ∧ B ∈ dom f)) → (𝐹‘(recs(𝐹) ↾ B)) = (𝐹‘(f ↾ B)))
35	26, 34	eqeq12d 2036	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((f ⊆ recs(𝐹) ∧ ((f Fn x ∧ x ∈ On) ∧ B ∈ dom f)) → ((recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)) ↔ (f‘B) = (𝐹‘(f ↾ B))))
36	35	exbiri 364	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (f ⊆ recs(𝐹) → (((f Fn x ∧ x ∈ On) ∧ B ∈ dom f) → ((f‘B) = (𝐹‘(f ↾ B)) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))
37	36	com3l 75	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((f Fn x ∧ x ∈ On) ∧ B ∈ dom f) → ((f‘B) = (𝐹‘(f ↾ B)) → (f ⊆ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))
38	37	exp31 346	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (f Fn x → (x ∈ On → (B ∈ dom f → ((f‘B) = (𝐹‘(f ↾ B)) → (f ⊆ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))))
39	38	com34 77	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (f Fn x → (x ∈ On → ((f‘B) = (𝐹‘(f ↾ B)) → (B ∈ dom f → (f ⊆ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))))
40	39	com24 81	. . . . . . . . . . . . . . . . . . . 20 ⊢ (f Fn x → (B ∈ dom f → ((f‘B) = (𝐹‘(f ↾ B)) → (x ∈ On → (f ⊆ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))))
41	22, 40	sylbird 159	. . . . . . . . . . . . . . . . . . 19 ⊢ (f Fn x → (B ∈ x → ((f‘B) = (𝐹‘(f ↾ B)) → (x ∈ On → (f ⊆ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))))
42	41	com3l 75	. . . . . . . . . . . . . . . . . 18 ⊢ (B ∈ x → ((f‘B) = (𝐹‘(f ↾ B)) → (f Fn x → (x ∈ On → (f ⊆ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))))
43	20, 42	syld 40	. . . . . . . . . . . . . . . . 17 ⊢ (B ∈ x → (∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)) → (f Fn x → (x ∈ On → (f ⊆ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))))
44	43	com24 81	. . . . . . . . . . . . . . . 16 ⊢ (B ∈ x → (x ∈ On → (f Fn x → (∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)) → (f ⊆ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))))
45	44	imp4d 334	. . . . . . . . . . . . . . 15 ⊢ (B ∈ x → ((x ∈ On ∧ (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))) → (f ⊆ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))
46	15, 45	mpdi 38	. . . . . . . . . . . . . 14 ⊢ (B ∈ x → ((x ∈ On ∧ (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B))))
47	7, 46	syl 14	. . . . . . . . . . . . 13 ⊢ ((f Fn x ∧ ⟨B, z⟩ ∈ f) → ((x ∈ On ∧ (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B))))
48	47	exp4d 351	. . . . . . . . . . . 12 ⊢ ((f Fn x ∧ ⟨B, z⟩ ∈ f) → (x ∈ On → (f Fn x → (∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B))))))
49	48	ex 108	. . . . . . . . . . 11 ⊢ (f Fn x → (⟨B, z⟩ ∈ f → (x ∈ On → (f Fn x → (∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))))
50	49	com4r 80	. . . . . . . . . 10 ⊢ (f Fn x → (f Fn x → (⟨B, z⟩ ∈ f → (x ∈ On → (∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))))
51	50	pm2.43i 43	. . . . . . . . 9 ⊢ (f Fn x → (⟨B, z⟩ ∈ f → (x ∈ On → (∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B))))))
52	51	com3l 75	. . . . . . . 8 ⊢ (⟨B, z⟩ ∈ f → (x ∈ On → (f Fn x → (∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B))))))
53	52	imp4a 331	. . . . . . 7 ⊢ (⟨B, z⟩ ∈ f → (x ∈ On → ((f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y))) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))))
54	53	rexlimdv 2410	. . . . . 6 ⊢ (⟨B, z⟩ ∈ f → (∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y))) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B))))
55	54	imp 115	. . . . 5 ⊢ ((⟨B, z⟩ ∈ f ∧ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))
56	55	exlimiv 1471	. . . 4 ⊢ (∃f(⟨B, z⟩ ∈ f ∧ ∃x ∈ On (f Fn x ∧ ∀y ∈ x (f‘y) = (𝐹‘(f ↾ y)))) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))
57	6, 56	sylbi 114	. . 3 ⊢ (⟨B, z⟩ ∈ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))
58	57	exlimiv 1471	. 2 ⊢ (∃z⟨B, z⟩ ∈ recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))
59	2, 58	syl 14	1 ⊢ (B ∈ dom recs(𝐹) → (recs(𝐹)‘B) = (𝐹‘(recs(𝐹) ↾ B)))

Syntax hints:   → wi 4   ∧ wa 97   ∧ w3a 873   = wceq 1228  ∃wex 1362   ∈ wcel 1374  {cab 2008  ∀wral 2284  ∃wrex 2285   ⊆ wss 2894  ⟨cop 3353  ∪ cuni 3554  Oncon0 4049  dom cdm 4272   ↾ cres 4274  Fun wfun 4823   Fn wfn 4824  ‘cfv 4829  recscrecs 5841

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 617  ax-5 1316  ax-7 1317  ax-gen 1318  ax-ie1 1363  ax-ie2 1364  ax-8 1376  ax-10 1377  ax-11 1378  ax-i12 1379  ax-bnd 1380  ax-4 1381  ax-14 1386  ax-17 1400  ax-i9 1404  ax-ial 1409  ax-i5r 1410  ax-ext 2004  ax-sep 3849  ax-pow 3901  ax-pr 3918  ax-setind 4204

This theorem depends on definitions:  df-bi 110  df-3an 875  df-tru 1231  df-nf 1330  df-sb 1628  df-eu 1885  df-mo 1886  df-clab 2009  df-cleq 2015  df-clel 2018  df-nfc 2149  df-ral 2289  df-rex 2290  df-rab 2293  df-v 2537  df-sbc 2742  df-csb 2830  df-un 2899  df-in 2901  df-ss 2908  df-pw 3336  df-sn 3356  df-pr 3357  df-op 3359  df-uni 3555  df-iun 3633  df-br 3739  df-opab 3793  df-mpt 3794  df-tr 3829  df-id 4004  df-iord 4052  df-on 4054  df-xp 4278  df-rel 4279  df-cnv 4280  df-co 4281  df-dm 4282  df-res 4284  df-iota 4794  df-fun 4831  df-fn 4832  df-fv 4837  df-recs 5842

This theorem is referenced by:  tfr2a  5858  tfrlemiubacc  5865