Theorem frsucmptn 8447

Description: The value of the finite recursive definition generator at a successor (special case where the characteristic function is a mapping abstraction and where the mapping class 𝐷 is a proper class). This is a technical lemma that can be used together with frsucmpt 8446 to help eliminate redundant sethood antecedents. (Contributed by Scott Fenton, 19-Feb-2011.) (Revised by Mario Carneiro, 11-Sep-2015.)

Hypotheses

Ref	Expression
frsucmpt.1	⊢ Ⅎ𝑥𝐴
frsucmpt.2	⊢ Ⅎ𝑥𝐵
frsucmpt.3	⊢ Ⅎ𝑥𝐷
frsucmpt.4	⊢ 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)
frsucmpt.5	⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷)

Assertion

Ref	Expression
frsucmptn	⊢ (¬ 𝐷 ∈ V → (𝐹‘suc 𝐵) = ∅)

Proof of Theorem frsucmptn

Step	Hyp	Ref	Expression
1		frsucmpt.4	. . 3 ⊢ 𝐹 = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)
2	1	fveq1i 6886	. 2 ⊢ (𝐹‘suc 𝐵) = ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵)
3		frfnom 8443	. . . . . 6 ⊢ (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) Fn ω
4		fndm 6642	. . . . . 6 ⊢ ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) Fn ω → dom (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) = ω)
5	3, 4	ax-mp 5	. . . . 5 ⊢ dom (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) = ω
6	5	eleq2i 2853	. . . 4 ⊢ (suc 𝐵 ∈ dom (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) ↔ suc 𝐵 ∈ ω)
7		peano2b 7894	. . . . 5 ⊢ (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω)
8		frsuc 8445	. . . . . . . 8 ⊢ (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵)))
9	1	fveq1i 6886	. . . . . . . . 9 ⊢ (𝐹‘𝐵) = ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵)
10	9	fveq2i 6888	. . . . . . . 8 ⊢ ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = ((𝑥 ∈ V ↦ 𝐶)‘((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘𝐵))
11	8, 10	eqtr4di 2814	. . . . . . 7 ⊢ (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)))
12		nfmpt1 5204	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥(𝑥 ∈ V ↦ 𝐶)
13		frsucmpt.1	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝐴
14	12, 13	nfrdg 8422	. . . . . . . . . . 11 ⊢ Ⅎ𝑥rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
15		nfcv 2923	. . . . . . . . . . 11 ⊢ Ⅎ𝑥ω
16	14, 15	nfres 5972	. . . . . . . . . 10 ⊢ Ⅎ𝑥(rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)
17	1, 16	nfcxfr 2921	. . . . . . . . 9 ⊢ Ⅎ𝑥𝐹
18		frsucmpt.2	. . . . . . . . 9 ⊢ Ⅎ𝑥𝐵
19	17, 18	nffv 6895	. . . . . . . 8 ⊢ Ⅎ𝑥(𝐹‘𝐵)
20		frsucmpt.3	. . . . . . . 8 ⊢ Ⅎ𝑥𝐷
21		frsucmpt.5	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷)
22		eqid 2761	. . . . . . . 8 ⊢ (𝑥 ∈ V ↦ 𝐶) = (𝑥 ∈ V ↦ 𝐶)
23	19, 20, 21, 22	fvmptnf 7016	. . . . . . 7 ⊢ (¬ 𝐷 ∈ V → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = ∅)
24	11, 23	sylan9eqr 2818	. . . . . 6 ⊢ ((¬ 𝐷 ∈ V ∧ 𝐵 ∈ ω) → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ∅)
25	24	ex 418	. . . . 5 ⊢ (¬ 𝐷 ∈ V → (𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ∅))
26	7, 25	biimtrrid 246	. . . 4 ⊢ (¬ 𝐷 ∈ V → (suc 𝐵 ∈ ω → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ∅))
27	6, 26	biimtrid 245	. . 3 ⊢ (¬ 𝐷 ∈ V → (suc 𝐵 ∈ dom (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ∅))
28		ndmfv 6917	. . 3 ⊢ (¬ suc 𝐵 ∈ dom (rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω) → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ∅)
29	27, 28	pm2.61d1 182	. 2 ⊢ (¬ 𝐷 ∈ V → ((rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↾ ω)‘suc 𝐵) = ∅)
30	2, 29	eqtrid 2808	1 ⊢ (¬ 𝐷 ∈ V → (𝐹‘suc 𝐵) = ∅)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2908  Vcvv 3451  ∅c0 4279   ↦ cmpt 5186  dom cdm 5651   ↾ cres 5653  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877  reccrdg 8417

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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418

This theorem is used by: (None)