| 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 5561 and closed form of epeli 5560. 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 5109 | . . . 4 ⊢ (𝐴 E 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ E ) | |
| 2 | 0nelopab 5547 | . . . . . . . 8 ⊢ ¬ ∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ 𝑦} | |
| 3 | df-eprel 5558 | . . . . . . . . . 10 ⊢ E = {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ 𝑦} | |
| 4 | 3 | eqcomi 2772 | . . . . . . . . 9 ⊢ {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ 𝑦} = E |
| 5 | 4 | eleq2i 2856 | . . . . . . . 8 ⊢ (∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ 𝑦} ↔ ∅ ∈ E ) |
| 6 | 2, 5 | mtbi 325 | . . . . . . 7 ⊢ ¬ ∅ ∈ E |
| 7 | eleq1 2852 | . . . . . . 7 ⊢ (〈𝐴, 𝐵〉 = ∅ → (〈𝐴, 𝐵〉 ∈ E ↔ ∅ ∈ E )) | |
| 8 | 6, 7 | mtbiri 330 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 = ∅ → ¬ 〈𝐴, 𝐵〉 ∈ E ) |
| 9 | 8 | con2i 140 | . . . . 5 ⊢ (〈𝐴, 𝐵〉 ∈ E → ¬ 〈𝐴, 𝐵〉 = ∅) |
| 10 | opprc1 4860 | . . . . 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 3475 | . . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V) | |
| 15 | 14 | a1i 11 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 → 𝐴 ∈ V)) |
| 16 | eleq12 2854 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 ∈ 𝑦 ↔ 𝐴 ∈ 𝐵)) | |
| 17 | 16, 3 | brabga 5515 | . . 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 2147 Vcvv 3454 ∅c0 4281 〈cop 4840 class class class wbr 5108 {copab 5173 E cep 5557 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pr 5398 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-eprel 5558 |
| This theorem is used by: epeli 5560 efrirr 5638 efrn2lp 5639 epin 6111 predep 6359 epne3 7819 cnfcomlem 9737 fpwwe2lem5 10759 ltpiord 11011 tgelrnpln 29311 orvcelval 35212 bj-epelb 38254 brcnvep 39468 onsupuni 44492 oninfint 44499 onepsuc 44515 cantnfresb 44587 epelon2 44783 alephiso2 44820 |
| Copyright terms: Public domain | W3C validator |