| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > epelg | Structured version Visualization version GIF version | ||
| Description: The membership relation and the membership predicate agree when the "containing" class is a set. General version of epel 5566 and closed form of epeli 5565. Definition 1.6 of [Schloeder] p. 1. (Contributed by Scott Fenton, 27-Mar-2011.) (Revised by Mario Carneiro, 28-Apr-2015.) (Proof shortened by BJ, 14-Jul-2023.) |
| Ref | Expression |
|---|---|
| epelg | ⊢ (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-br 5112 | . . . 4 ⊢ (𝐴 E 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ E ) | |
| 2 | 0nelopab 5552 | . . . . . . . 8 ⊢ ¬ ∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ 𝑦} | |
| 3 | df-eprel 5563 | . . . . . . . . . 10 ⊢ E = {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ 𝑦} | |
| 4 | 3 | eqcomi 2774 | . . . . . . . . 9 ⊢ {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ 𝑦} = E |
| 5 | 4 | eleq2i 2857 | . . . . . . . 8 ⊢ (∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ 𝑦} ↔ ∅ ∈ E ) |
| 6 | 2, 5 | mtbi 325 | . . . . . . 7 ⊢ ¬ ∅ ∈ E |
| 7 | eleq1 2853 | . . . . . . 7 ⊢ (〈𝐴, 𝐵〉 = ∅ → (〈𝐴, 𝐵〉 ∈ E ↔ ∅ ∈ E )) | |
| 8 | 6, 7 | mtbiri 330 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 = ∅ → ¬ 〈𝐴, 𝐵〉 ∈ E ) |
| 9 | 8 | con2i 140 | . . . . 5 ⊢ (〈𝐴, 𝐵〉 ∈ E → ¬ 〈𝐴, 𝐵〉 = ∅) |
| 10 | opprc1 4864 | . . . . 5 ⊢ (¬ 𝐴 ∈ V → 〈𝐴, 𝐵〉 = ∅) | |
| 11 | 9, 10 | nsyl2 142 | . . . 4 ⊢ (〈𝐴, 𝐵〉 ∈ E → 𝐴 ∈ V) |
| 12 | 1, 11 | sylbi 220 | . . 3 ⊢ (𝐴 E 𝐵 → 𝐴 ∈ V) |
| 13 | 12 | a1i 11 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 → 𝐴 ∈ V)) |
| 14 | elex 3478 | . . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V) | |
| 15 | 14 | a1i 11 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 → 𝐴 ∈ V)) |
| 16 | eleq12 2855 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 ∈ 𝑦 ↔ 𝐴 ∈ 𝐵)) | |
| 17 | 16, 3 | brabga 5520 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
| 18 | 17 | expcom 419 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ V → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵))) |
| 19 | 13, 15, 18 | pm5.21ndd 382 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2146 Vcvv 3457 ∅c0 4286 〈cop 4597 class class class wbr 5111 {copab 5175 E cep 5562 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5112 df-opab 5176 df-eprel 5563 |
| This theorem is used by: epeli 5565 efrirr 5643 efrn2lp 5644 epin 6099 predep 6335 epne3 7774 cnfcomlem 9671 fpwwe2lem5 10631 ltpiord 10883 tgelrnpln 29087 orvcelval 34883 bj-epelb 37738 brcnvep 38952 onsupuni 43989 oninfint 43996 onepsuc 44012 cantnfresb 44084 epelon2 44280 alephiso2 44317 |
| Copyright terms: Public domain | W3C validator |