Theorem sucmapsuc 39687

Description: A set is succeeded by its successor. (Contributed by Peter Mazsa, 7-Jan-2026.)

Assertion

Ref	Expression
sucmapsuc	⊢ (𝑀 ∈ 𝑉 → 𝑀 SucMap suc 𝑀)

Proof of Theorem sucmapsuc

Step	Hyp	Ref	Expression
1		eqid 2763	. 2 ⊢ suc 𝑀 = suc 𝑀
2		sucexg 7853	. . 3 ⊢ (𝑀 ∈ 𝑉 → suc 𝑀 ∈ V)
3		brsucmap 39664	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ suc 𝑀 ∈ V) → (𝑀 SucMap suc 𝑀 ↔ suc 𝑀 = suc 𝑀))
4	2, 3	mpdan 700	. 2 ⊢ (𝑀 ∈ 𝑉 → (𝑀 SucMap suc 𝑀 ↔ suc 𝑀 = suc 𝑀))
5	1, 4	mpbiri 261	1 ⊢ (𝑀 ∈ 𝑉 → 𝑀 SucMap suc 𝑀)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  Vcvv 3454   class class class wbr 5108  suc csuc 6390   SucMap csucmap 39376

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398  ax-un 7783

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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-suc 6394  df-sucmap 39660

This theorem is used by:  presuc  39696