Theorem bj-epelg 37903

Description: The membership relation and the membership predicate agree when the "containing" class is a set. General version of epel 5550 and closed form of epeli 5549. (Contributed by Scott Fenton, 27-Mar-2011.) (Revised by Mario Carneiro, 28-Apr-2015.) TODO: move it to the main section after reordering to have brrelex1i 5703 available. (Proof shortened by BJ, 14-Jul-2023.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-epelg	⊢ (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵))

Proof of Theorem bj-epelg

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rele 5801	. . . 4 ⊢ Rel E
2	1	brrelex1i 5703	. . 3 ⊢ (𝐴 E 𝐵 → 𝐴 ∈ V)
3	2	a1i 11	. 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 → 𝐴 ∈ V))
4		elex 3471	. . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V)
5	4	a1i 11	. 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 → 𝐴 ∈ V))
6		eleq12 2850	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 ∈ 𝑦 ↔ 𝐴 ∈ 𝐵))
7		df-eprel 5547	. . . 4 ⊢ E = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦}
8	6, 7	brabga 5504	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵))
9	8	expcom 419	. 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ V → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)))
10	3, 5, 9	pm5.21ndd 382	1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∈ wcel 2145  Vcvv 3450   class class class wbr 5102   E cep 5546

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 2732  ax-sep 5248  ax-pr 5390

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 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-eprel 5547  df-xp 5653  df-rel 5654

This theorem is used by: (None)