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 6260 | . 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ suc 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴 ∈ suc 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∨ wo 843 = wceq 1537 ∈ wcel 2114 Vcvv 3496 suc csuc 6195 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-v 3498 df-un 3943 df-sn 4570 df-suc 6199 |
This theorem is referenced by: sucel 6266 limsssuc 7567 omsmolem 8282 cantnfle 9136 infxpenlem 9441 inatsk 10202 untsucf 32938 dfon2lem7 33036 nolesgn2ores 33181 rdgssun 34661 |
Copyright terms: Public domain | W3C validator |