Theorem dfsuccf2 36920

Description: Alternate definition of Scott Fenton's version of Succ, cf. df-sucmap 39660. (Contributed by Peter Mazsa, 6-Jan-2026.)

Assertion

Ref	Expression
dfsuccf2	⊢ Succ = {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}

Distinct variable group:   𝑚,𝑛

Proof of Theorem dfsuccf2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-succf 36849	. 2 ⊢ Succ = (Cup ∘ ( I ⊗ Singleton))
2		df-co 5667	. 2 ⊢ (Cup ∘ ( I ⊗ Singleton)) = {⟨𝑚, 𝑛⟩ ∣ ∃𝑥(𝑚( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝑛)}
3		vex 3458	. . . . 5 ⊢ 𝑚 ∈ V
4		vex 3458	. . . . 5 ⊢ 𝑛 ∈ V
5	3, 4	lemsuccf 36918	. . . 4 ⊢ (∃𝑥(𝑚( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝑛) ↔ 𝑛 = suc 𝑚)
6		eqcom 2770	. . . 4 ⊢ (𝑛 = suc 𝑚 ↔ suc 𝑚 = 𝑛)
7	5, 6	bitri 278	. . 3 ⊢ (∃𝑥(𝑚( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝑛) ↔ suc 𝑚 = 𝑛)
8	7	opabbii 5178	. 2 ⊢ {⟨𝑚, 𝑛⟩ ∣ ∃𝑥(𝑚( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝑛)} = {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
9	1, 2, 8	3eqtri 2790	1 ⊢ Succ = {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   class class class wbr 5108  {copab 5173   I cid 5552   ∘ ccom 5662  suc csuc 6390   ⊗ ctxp 36807  Singletoncsingle 36815  Cupccup 36823  Succcsuccf 36825

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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-symdif 4201  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-mpt 5193  df-id 5553  df-eprel 5558  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fo 6572  df-fv 6574  df-1st 8035  df-2nd 8036  df-txp 36831  df-singleton 36839  df-cup 36846  df-succf 36849

This theorem is used by: (None)