Theorem wfrlem14OLD 8361

Description: Obsolete version as of 18-Nov-2024. Lemma for well-ordered recursion. Compute the value of 𝐶. (New usage is discouraged.) (Proof modification is discouraged.) (Contributed by Scott Fenton, 21-Apr-2011.)

Hypotheses

Ref	Expression
wfrlem13OLD.1	⊢ 𝑅 We 𝐴
wfrlem13OLD.2	⊢ 𝑅 Se 𝐴
wfrlem13OLD.3	⊢ 𝐹 = wrecs(𝑅, 𝐴, 𝐺)
wfrlem13OLD.4	⊢ 𝐶 = (𝐹 ∪ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩})

Assertion

Ref	Expression
wfrlem14OLD	⊢ (𝑧 ∈ (𝐴 ∖ dom 𝐹) → (𝑦 ∈ (dom 𝐹 ∪ {𝑧}) → (𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)))))

Distinct variable groups:   𝑦,𝐴,𝑧   𝑦,𝐹,𝑧   𝑦,𝐺   𝑦,𝑅,𝑧   𝑦,𝐶

Allowed substitution hints:   𝐶(𝑧)   𝐺(𝑧)

Proof of Theorem wfrlem14OLD

Step	Hyp	Ref	Expression
1		wfrlem13OLD.1	. . 3 ⊢ 𝑅 We 𝐴
2		wfrlem13OLD.2	. . 3 ⊢ 𝑅 Se 𝐴
3		wfrlem13OLD.3	. . 3 ⊢ 𝐹 = wrecs(𝑅, 𝐴, 𝐺)
4		wfrlem13OLD.4	. . 3 ⊢ 𝐶 = (𝐹 ∪ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩})
5	1, 2, 3, 4	wfrlem13OLD 8360	. 2 ⊢ (𝑧 ∈ (𝐴 ∖ dom 𝐹) → 𝐶 Fn (dom 𝐹 ∪ {𝑧}))
6		elun 4163	. . . 4 ⊢ (𝑦 ∈ (dom 𝐹 ∪ {𝑧}) ↔ (𝑦 ∈ dom 𝐹 ∨ 𝑦 ∈ {𝑧}))
7		velsn 4647	. . . . 5 ⊢ (𝑦 ∈ {𝑧} ↔ 𝑦 = 𝑧)
8	7	orbi2i 912	. . . 4 ⊢ ((𝑦 ∈ dom 𝐹 ∨ 𝑦 ∈ {𝑧}) ↔ (𝑦 ∈ dom 𝐹 ∨ 𝑦 = 𝑧))
9	6, 8	bitri 275	. . 3 ⊢ (𝑦 ∈ (dom 𝐹 ∪ {𝑧}) ↔ (𝑦 ∈ dom 𝐹 ∨ 𝑦 = 𝑧))
10	1, 2, 3	wfrlem12OLD 8359	. . . . . . 7 ⊢ (𝑦 ∈ dom 𝐹 → (𝐹‘𝑦) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))))
11		fnfun 6669	. . . . . . . 8 ⊢ (𝐶 Fn (dom 𝐹 ∪ {𝑧}) → Fun 𝐶)
12		ssun1 4188	. . . . . . . . . 10 ⊢ 𝐹 ⊆ (𝐹 ∪ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩})
13	12, 4	sseqtrri 4033	. . . . . . . . 9 ⊢ 𝐹 ⊆ 𝐶
14		funssfv 6928	. . . . . . . . . 10 ⊢ ((Fun 𝐶 ∧ 𝐹 ⊆ 𝐶 ∧ 𝑦 ∈ dom 𝐹) → (𝐶‘𝑦) = (𝐹‘𝑦))
15	3	wfrdmclOLD 8356	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ dom 𝐹 → Pred(𝑅, 𝐴, 𝑦) ⊆ dom 𝐹)
16		fun2ssres 6613	. . . . . . . . . . . 12 ⊢ ((Fun 𝐶 ∧ 𝐹 ⊆ 𝐶 ∧ Pred(𝑅, 𝐴, 𝑦) ⊆ dom 𝐹) → (𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))
17	15, 16	syl3an3 1164	. . . . . . . . . . 11 ⊢ ((Fun 𝐶 ∧ 𝐹 ⊆ 𝐶 ∧ 𝑦 ∈ dom 𝐹) → (𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))
18	17	fveq2d 6911	. . . . . . . . . 10 ⊢ ((Fun 𝐶 ∧ 𝐹 ⊆ 𝐶 ∧ 𝑦 ∈ dom 𝐹) → (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))))
19	14, 18	eqeq12d 2751	. . . . . . . . 9 ⊢ ((Fun 𝐶 ∧ 𝐹 ⊆ 𝐶 ∧ 𝑦 ∈ dom 𝐹) → ((𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐹‘𝑦) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))))
20	13, 19	mp3an2 1448	. . . . . . . 8 ⊢ ((Fun 𝐶 ∧ 𝑦 ∈ dom 𝐹) → ((𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐹‘𝑦) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))))
21	11, 20	sylan 580	. . . . . . 7 ⊢ ((𝐶 Fn (dom 𝐹 ∪ {𝑧}) ∧ 𝑦 ∈ dom 𝐹) → ((𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐹‘𝑦) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))))
22	10, 21	imbitrrid 246	. . . . . 6 ⊢ ((𝐶 Fn (dom 𝐹 ∪ {𝑧}) ∧ 𝑦 ∈ dom 𝐹) → (𝑦 ∈ dom 𝐹 → (𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)))))
23	22	ex 412	. . . . 5 ⊢ (𝐶 Fn (dom 𝐹 ∪ {𝑧}) → (𝑦 ∈ dom 𝐹 → (𝑦 ∈ dom 𝐹 → (𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦))))))
24	23	pm2.43d 53	. . . 4 ⊢ (𝐶 Fn (dom 𝐹 ∪ {𝑧}) → (𝑦 ∈ dom 𝐹 → (𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)))))
25		vsnid 4668	. . . . . . 7 ⊢ 𝑧 ∈ {𝑧}
26		elun2 4193	. . . . . . 7 ⊢ (𝑧 ∈ {𝑧} → 𝑧 ∈ (dom 𝐹 ∪ {𝑧}))
27	25, 26	ax-mp 5	. . . . . 6 ⊢ 𝑧 ∈ (dom 𝐹 ∪ {𝑧})
28	4	reseq1i 5996	. . . . . . . . . . . . 13 ⊢ (𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)) = ((𝐹 ∪ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩}) ↾ Pred(𝑅, 𝐴, 𝑧))
29		resundir 6015	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∪ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩}) ↾ Pred(𝑅, 𝐴, 𝑧)) = ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) ∪ ({⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩} ↾ Pred(𝑅, 𝐴, 𝑧)))
30		wefr 5679	. . . . . . . . . . . . . . . . 17 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴)
31	1, 30	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ 𝑅 Fr 𝐴
32		predfrirr 6357	. . . . . . . . . . . . . . . 16 ⊢ (𝑅 Fr 𝐴 → ¬ 𝑧 ∈ Pred(𝑅, 𝐴, 𝑧))
33		ressnop0 7173	. . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑧 ∈ Pred(𝑅, 𝐴, 𝑧) → ({⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩} ↾ Pred(𝑅, 𝐴, 𝑧)) = ∅)
34	31, 32, 33	mp2b 10	. . . . . . . . . . . . . . 15 ⊢ ({⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩} ↾ Pred(𝑅, 𝐴, 𝑧)) = ∅
35	34	uneq2i 4175	. . . . . . . . . . . . . 14 ⊢ ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) ∪ ({⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩} ↾ Pred(𝑅, 𝐴, 𝑧))) = ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) ∪ ∅)
36		un0 4400	. . . . . . . . . . . . . 14 ⊢ ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) ∪ ∅) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))
37	35, 36	eqtri 2763	. . . . . . . . . . . . 13 ⊢ ((𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)) ∪ ({⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩} ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))
38	28, 29, 37	3eqtri 2767	. . . . . . . . . . . 12 ⊢ (𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))
39	38	fveq2i 6910	. . . . . . . . . . 11 ⊢ (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧))) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))
40	39	opeq2i 4882	. . . . . . . . . 10 ⊢ ⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ = ⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩
41		opex 5475	. . . . . . . . . . 11 ⊢ ⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ ∈ V
42	41	elsn 4646	. . . . . . . . . 10 ⊢ (⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ ∈ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩} ↔ ⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ = ⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩)
43	40, 42	mpbir 231	. . . . . . . . 9 ⊢ ⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ ∈ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩}
44		elun2 4193	. . . . . . . . 9 ⊢ (⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ ∈ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩} → ⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ ∈ (𝐹 ∪ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩}))
45	43, 44	ax-mp 5	. . . . . . . 8 ⊢ ⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ ∈ (𝐹 ∪ {⟨𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩})
46	45, 4	eleqtrri 2838	. . . . . . 7 ⊢ ⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ ∈ 𝐶
47		fnopfvb 6961	. . . . . . 7 ⊢ ((𝐶 Fn (dom 𝐹 ∪ {𝑧}) ∧ 𝑧 ∈ (dom 𝐹 ∪ {𝑧})) → ((𝐶‘𝑧) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧))) ↔ ⟨𝑧, (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))⟩ ∈ 𝐶))
48	46, 47	mpbiri 258	. . . . . 6 ⊢ ((𝐶 Fn (dom 𝐹 ∪ {𝑧}) ∧ 𝑧 ∈ (dom 𝐹 ∪ {𝑧})) → (𝐶‘𝑧) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧))))
49	27, 48	mpan2 691	. . . . 5 ⊢ (𝐶 Fn (dom 𝐹 ∪ {𝑧}) → (𝐶‘𝑧) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧))))
50		fveq2 6907	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝐶‘𝑦) = (𝐶‘𝑧))
51		predeq3 6327	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑧))
52	51	reseq2d 6000	. . . . . . 7 ⊢ (𝑦 = 𝑧 → (𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))
53	52	fveq2d 6911	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧))))
54	50, 53	eqeq12d 2751	. . . . 5 ⊢ (𝑦 = 𝑧 → ((𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐶‘𝑧) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑧)))))
55	49, 54	syl5ibrcom 247	. . . 4 ⊢ (𝐶 Fn (dom 𝐹 ∪ {𝑧}) → (𝑦 = 𝑧 → (𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)))))
56	24, 55	jaod 859	. . 3 ⊢ (𝐶 Fn (dom 𝐹 ∪ {𝑧}) → ((𝑦 ∈ dom 𝐹 ∨ 𝑦 = 𝑧) → (𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)))))
57	9, 56	biimtrid 242	. 2 ⊢ (𝐶 Fn (dom 𝐹 ∪ {𝑧}) → (𝑦 ∈ (dom 𝐹 ∪ {𝑧}) → (𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)))))
58	5, 57	syl 17	1 ⊢ (𝑧 ∈ (𝐴 ∖ dom 𝐹) → (𝑦 ∈ (dom 𝐹 ∪ {𝑧}) → (𝐶‘𝑦) = (𝐺‘(𝐶 ↾ Pred(𝑅, 𝐴, 𝑦)))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106   ∖ cdif 3960   ∪ cun 3961   ⊆ wss 3963  ∅c0 4339  {csn 4631  ⟨cop 4637   Fr wfr 5638   Se wse 5639   We wwe 5640  dom cdm 5689   ↾ cres 5691  Predcpred 6322  Fun wfun 6557   Fn wfn 6558  ‘cfv 6563  wrecscwrecs 8335

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-po 5597  df-so 5598  df-fr 5641  df-se 5642  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-fo 6569  df-fv 6571  df-ov 7434  df-2nd 8014  df-frecs 8305  df-wrecs 8336

This theorem is referenced by:  wfrlem15OLD  8362