Theorem rdgsucmptnf 8380

Description: The value of the recursive definition generator at a successor (special case where the characteristic function is an ordered-pair class abstraction and where the mapping class 𝐷 is a proper class). This is a technical lemma that can be used together with rdgsucmptf 8379 to help eliminate redundant sethood antecedents. (Contributed by NM, 22-Oct-2003.) (Revised by Mario Carneiro, 15-Oct-2016.)

Hypotheses

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

Assertion

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

Proof of Theorem rdgsucmptnf

Step	Hyp	Ref	Expression
1		rdgsucmptf.4	. . 3 ⊢ 𝐹 = rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
2	1	fveq1i 6848	. 2 ⊢ (𝐹‘suc 𝐵) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵)
3		rdgdmlim 8368	. . . . 5 ⊢ Lim dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
4		limsuc 7790	. . . . 5 ⊢ (Lim dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴) → (𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↔ suc 𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴)))
5	3, 4	ax-mp 5	. . . 4 ⊢ (𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴) ↔ suc 𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴))
6		rdgsucg 8374	. . . . . . 7 ⊢ (𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴) → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵)))
7	1	fveq1i 6848	. . . . . . . 8 ⊢ (𝐹‘𝐵) = (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵)
8	7	fveq2i 6850	. . . . . . 7 ⊢ ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = ((𝑥 ∈ V ↦ 𝐶)‘(rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘𝐵))
9	6, 8	eqtr4di 2789	. . . . . 6 ⊢ (𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴) → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)))
10		nfmpt1 5218	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑥 ∈ V ↦ 𝐶)
11		rdgsucmptf.1	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝐴
12	10, 11	nfrdg 8365	. . . . . . . . 9 ⊢ Ⅎ𝑥rec((𝑥 ∈ V ↦ 𝐶), 𝐴)
13	1, 12	nfcxfr 2900	. . . . . . . 8 ⊢ Ⅎ𝑥𝐹
14		rdgsucmptf.2	. . . . . . . 8 ⊢ Ⅎ𝑥𝐵
15	13, 14	nffv 6857	. . . . . . 7 ⊢ Ⅎ𝑥(𝐹‘𝐵)
16		rdgsucmptf.3	. . . . . . 7 ⊢ Ⅎ𝑥𝐷
17		rdgsucmptf.5	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐵) → 𝐶 = 𝐷)
18		eqid 2731	. . . . . . 7 ⊢ (𝑥 ∈ V ↦ 𝐶) = (𝑥 ∈ V ↦ 𝐶)
19	15, 16, 17, 18	fvmptnf 6975	. . . . . 6 ⊢ (¬ 𝐷 ∈ V → ((𝑥 ∈ V ↦ 𝐶)‘(𝐹‘𝐵)) = ∅)
20	9, 19	sylan9eqr 2793	. . . . 5 ⊢ ((¬ 𝐷 ∈ V ∧ 𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴)) → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ∅)
21	20	ex 413	. . . 4 ⊢ (¬ 𝐷 ∈ V → (𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴) → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ∅))
22	5, 21	biimtrrid 242	. . 3 ⊢ (¬ 𝐷 ∈ V → (suc 𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴) → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ∅))
23		ndmfv 6882	. . 3 ⊢ (¬ suc 𝐵 ∈ dom rec((𝑥 ∈ V ↦ 𝐶), 𝐴) → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ∅)
24	22, 23	pm2.61d1 180	. 2 ⊢ (¬ 𝐷 ∈ V → (rec((𝑥 ∈ V ↦ 𝐶), 𝐴)‘suc 𝐵) = ∅)
25	2, 24	eqtrid 2783	1 ⊢ (¬ 𝐷 ∈ V → (𝐹‘suc 𝐵) = ∅)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   = wceq 1541   ∈ wcel 2106  Ⅎwnfc 2882  Vcvv 3446  ∅c0 4287   ↦ cmpt 5193  dom cdm 5638  Lim wlim 6323  suc csuc 6324  ‘cfv 6501  reccrdg 8360

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pr 5389  ax-un 7677

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3932  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-tr 5228  df-id 5536  df-eprel 5542  df-po 5550  df-so 5551  df-fr 5593  df-we 5595  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6258  df-ord 6325  df-on 6326  df-lim 6327  df-suc 6328  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-ov 7365  df-2nd 7927  df-frecs 8217  df-wrecs 8248  df-recs 8322  df-rdg 8361

This theorem is referenced by:  ttrclselem1  9670