MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  epelg Structured version   Visualization version   GIF version

Theorem epelg 5552
Description: The membership relation and the membership predicate agree when the "containing" class is a set. General version of epel 5554 and closed form of epeli 5553. 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.)
Assertion
Ref Expression
epelg (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵))

Proof of Theorem epelg
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-br 5104 . . . 4 (𝐴 E 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ E )
2 0nelopab 5540 . . . . . . . 8 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦}
3 df-eprel 5551 . . . . . . . . . 10 E = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦}
43eqcomi 2770 . . . . . . . . 9 {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦} = E
54eleq2i 2853 . . . . . . . 8 (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦} ↔ ∅ ∈ E )
62, 5mtbi 325 . . . . . . 7 ¬ ∅ ∈ E
7 eleq1 2849 . . . . . . 7 (⟨𝐴, 𝐵⟩ = ∅ → (⟨𝐴, 𝐵⟩ ∈ E ↔ ∅ ∈ E ))
86, 7mtbiri 330 . . . . . 6 (⟨𝐴, 𝐵⟩ = ∅ → ¬ ⟨𝐴, 𝐵⟩ ∈ E )
98con2i 140 . . . . 5 (⟨𝐴, 𝐵⟩ ∈ E → ¬ ⟨𝐴, 𝐵⟩ = ∅)
10 opprc1 4857 . . . . 5 (¬ 𝐴 ∈ V → ⟨𝐴, 𝐵⟩ = ∅)
119, 10nsyl2 142 . . . 4 (⟨𝐴, 𝐵⟩ ∈ E → 𝐴 ∈ V)
121, 11sylbi 220 . . 3 (𝐴 E 𝐵 → 𝐴 ∈ V)
1312a1i 11 . 2 (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 → 𝐴 ∈ V))
14 elex 3472 . . 3 (𝐴 ∈ 𝐵 → 𝐴 ∈ V)
1514a1i 11 . 2 (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 → 𝐴 ∈ V))
16 eleq12 2851 . . . 4 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 ∈ 𝑦 ↔ 𝐴 ∈ 𝐵))
1716, 3brabga 5508 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵))
1817expcom 419 . 2 (𝐵 ∈ 𝑉 → (𝐴 ∈ V → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)))
1913, 15, 18pm5.21ndd 382 1 (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ∅c0 4279  ⟨cop 4590   class class class wbr 5103  {copab 5167   E cep 5550
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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
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 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-eprel 5551
This theorem is used by:  epeli  5553  efrirr  5631  efrn2lp  5632  epin  6093  predep  6332  epne3  7785  cnfcomlem  9693  fpwwe2lem5  10713  ltpiord  10965  tgelrnpln  29247  orvcelval  35094  bj-epelb  37964  brcnvep  39182  onsupuni  44215  oninfint  44222  onepsuc  44238  cantnfresb  44310  epelon2  44506  alephiso2  44543
  Copyright terms: Public domain W3C validator