| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfsuccf2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of Scott Fenton's version of Succ, cf. df-sucmap 38783. (Contributed by Peter Mazsa, 6-Jan-2026.) |
| Ref | Expression |
|---|---|
| dfsuccf2 | ⊢ Succ = {〈𝑚, 𝑛〉 ∣ suc 𝑚 = 𝑛} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-succf 36052 | . 2 ⊢ Succ = (Cup ∘ ( I ⊗ Singleton)) | |
| 2 | df-co 5640 | . 2 ⊢ (Cup ∘ ( I ⊗ Singleton)) = {〈𝑚, 𝑛〉 ∣ ∃𝑥(𝑚( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝑛)} | |
| 3 | vex 3433 | . . . . 5 ⊢ 𝑚 ∈ V | |
| 4 | vex 3433 | . . . . 5 ⊢ 𝑛 ∈ V | |
| 5 | 3, 4 | lemsuccf 36121 | . . . 4 ⊢ (∃𝑥(𝑚( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝑛) ↔ 𝑛 = suc 𝑚) |
| 6 | eqcom 2743 | . . . 4 ⊢ (𝑛 = suc 𝑚 ↔ suc 𝑚 = 𝑛) | |
| 7 | 5, 6 | bitri 275 | . . 3 ⊢ (∃𝑥(𝑚( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝑛) ↔ suc 𝑚 = 𝑛) |
| 8 | 7 | opabbii 5152 | . 2 ⊢ {〈𝑚, 𝑛〉 ∣ ∃𝑥(𝑚( I ⊗ Singleton)𝑥 ∧ 𝑥Cup𝑛)} = {〈𝑚, 𝑛〉 ∣ suc 𝑚 = 𝑛} |
| 9 | 1, 2, 8 | 3eqtri 2763 | 1 ⊢ Succ = {〈𝑚, 𝑛〉 ∣ suc 𝑚 = 𝑛} |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 = wceq 1542 ∃wex 1781 class class class wbr 5085 {copab 5147 I cid 5525 ∘ ccom 5635 suc csuc 6325 ⊗ ctxp 36010 Singletoncsingle 36018 Cupccup 36026 Succcsuccf 36028 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-symdif 4193 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-eprel 5531 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fo 6504 df-fv 6506 df-1st 7942 df-2nd 7943 df-txp 36034 df-singleton 36042 df-cup 36049 df-succf 36052 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |