| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elsuc2g | Structured version Visualization version GIF version | ||
| Description: Variant of membership in a successor, requiring that 𝐵 rather than 𝐴 be a set. (Contributed by NM, 28-Oct-2003.) |
| Ref | Expression |
|---|---|
| elsuc2g | ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ suc 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-suc 6307 | . . 3 ⊢ suc 𝐵 = (𝐵 ∪ {𝐵}) | |
| 2 | 1 | eleq2i 2823 | . 2 ⊢ (𝐴 ∈ suc 𝐵 ↔ 𝐴 ∈ (𝐵 ∪ {𝐵})) |
| 3 | elun 4098 | . . 3 ⊢ (𝐴 ∈ (𝐵 ∪ {𝐵}) ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 ∈ {𝐵})) | |
| 4 | elsn2g 4612 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵)) | |
| 5 | 4 | orbi2d 915 | . . 3 ⊢ (𝐵 ∈ 𝑉 → ((𝐴 ∈ 𝐵 ∨ 𝐴 ∈ {𝐵}) ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| 6 | 3, 5 | bitrid 283 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ (𝐵 ∪ {𝐵}) ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| 7 | 2, 6 | bitrid 283 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ suc 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∨ wo 847 = wceq 1541 ∈ wcel 2111 ∪ cun 3895 {csn 4571 suc csuc 6303 |
| 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 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-v 3438 df-un 3902 df-sn 4572 df-suc 6307 |
| This theorem is referenced by: elsuc2 6374 om2uzlti 13852 |
| Copyright terms: Public domain | W3C validator |