| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elsuc | Structured version Visualization version GIF version | ||
| Description: Membership in a successor. Exercise 5 of [TakeutiZaring] p. 17. (Contributed by NM, 15-Sep-2003.) |
| Ref | Expression |
|---|---|
| elsuc.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| elsuc | ⊢ (𝐴 ∈ suc 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elsuc.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | elsucg 6427 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ suc 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴 ∈ suc 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∨ wo 847 = wceq 1540 ∈ wcel 2109 Vcvv 3464 suc csuc 6359 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-v 3466 df-un 3936 df-sn 4607 df-suc 6363 |
| This theorem is referenced by: sucel 6433 limsssuc 7850 omsmolem 8674 cantnfle 9690 infxpenlem 10032 inatsk 10797 nolesgn2ores 27641 nogesgn1ores 27643 untsucf 35732 dfon2lem7 35812 rdgssun 37401 omssaxinf2 44980 |
| Copyright terms: Public domain | W3C validator |