Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-tagex | Structured version Visualization version GIF version |
Description: A class is a set if and only if its tagging is a set. (Contributed by BJ, 6-Oct-2018.) |
Ref | Expression |
---|---|
bj-tagex | ⊢ (𝐴 ∈ V ↔ tag 𝐴 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bj-snglex 32154 | . . 3 ⊢ (𝐴 ∈ V ↔ sngl 𝐴 ∈ V) | |
2 | p0ex 4779 | . . . 4 ⊢ {∅} ∈ V | |
3 | 2 | biantru 525 | . . 3 ⊢ (sngl 𝐴 ∈ V ↔ (sngl 𝐴 ∈ V ∧ {∅} ∈ V)) |
4 | 1, 3 | bitri 263 | . 2 ⊢ (𝐴 ∈ V ↔ (sngl 𝐴 ∈ V ∧ {∅} ∈ V)) |
5 | unexb 6856 | . 2 ⊢ ((sngl 𝐴 ∈ V ∧ {∅} ∈ V) ↔ (sngl 𝐴 ∪ {∅}) ∈ V) | |
6 | df-bj-tag 32156 | . . . 4 ⊢ tag 𝐴 = (sngl 𝐴 ∪ {∅}) | |
7 | 6 | eqcomi 2619 | . . 3 ⊢ (sngl 𝐴 ∪ {∅}) = tag 𝐴 |
8 | 7 | eleq1i 2679 | . 2 ⊢ ((sngl 𝐴 ∪ {∅}) ∈ V ↔ tag 𝐴 ∈ V) |
9 | 4, 5, 8 | 3bitri 285 | 1 ⊢ (𝐴 ∈ V ↔ tag 𝐴 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 ∧ wa 383 ∈ wcel 1977 Vcvv 3173 ∪ cun 3538 ∅c0 3874 {csn 4125 sngl bj-csngl 32146 tag bj-ctag 32155 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-pw 4110 df-sn 4126 df-pr 4128 df-uni 4373 df-bj-sngl 32147 df-bj-tag 32156 |
This theorem is referenced by: bj-xtagex 32170 |
Copyright terms: Public domain | W3C validator |