![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-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 5589 and closed form of epeli 5588. (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 5738 available. (Proof shortened by BJ, 14-Jul-2023.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
bj-epelg | ⊢ (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rele 5833 | . . . 4 ⊢ Rel E | |
2 | 1 | brrelex1i 5738 | . . 3 ⊢ (𝐴 E 𝐵 → 𝐴 ∈ V) |
3 | 2 | a1i 11 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 → 𝐴 ∈ V)) |
4 | elex 3492 | . . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V) | |
5 | 4 | a1i 11 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 → 𝐴 ∈ V)) |
6 | eleq12 2819 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 ∈ 𝑦 ↔ 𝐴 ∈ 𝐵)) | |
7 | df-eprel 5586 | . . . 4 ⊢ E = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦} | |
8 | 6, 7 | brabga 5540 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
9 | 8 | expcom 412 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ V → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵))) |
10 | 3, 5, 9 | pm5.21ndd 378 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∈ wcel 2098 Vcvv 3473 class class class wbr 5152 E cep 5585 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pr 5433 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2706 df-cleq 2720 df-clel 2806 df-ral 3059 df-rex 3068 df-rab 3431 df-v 3475 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4327 df-if 4533 df-sn 4633 df-pr 4635 df-op 4639 df-br 5153 df-opab 5215 df-eprel 5586 df-xp 5688 df-rel 5689 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |