| 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 6316 | . . 3 ⊢ suc 𝐵 = (𝐵 ∪ {𝐵}) | |
| 2 | 1 | eleq2i 2831 | . 2 ⊢ (𝐴 ∈ suc 𝐵 ↔ 𝐴 ∈ (𝐵 ∪ {𝐵})) |
| 3 | elun 4083 | . . 3 ⊢ (𝐴 ∈ (𝐵 ∪ {𝐵}) ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 ∈ {𝐵})) | |
| 4 | elsn2g 4596 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵)) | |
| 5 | 4 | orbi2d 921 | . . 3 ⊢ (𝐵 ∈ 𝑉 → ((𝐴 ∈ 𝐵 ∨ 𝐴 ∈ {𝐵}) ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| 6 | 3, 5 | bitrid 284 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ (𝐵 ∪ {𝐵}) ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| 7 | 2, 6 | bitrid 284 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ suc 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∨ wo 853 = wceq 1547 ∈ wcel 2119 ∪ cun 3881 {csn 4555 suc csuc 6312 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-v 3433 df-un 3888 df-sn 4556 df-suc 6316 |
| This theorem is referenced by: elsuc2 6383 om2uzlti 13903 |
| Copyright terms: Public domain | W3C validator |