Theorem bj-tagcg 37475

Description: Characterization of the elements of 𝐵 in terms of elements of its tagged version. (Contributed by BJ, 6-Oct-2018.)

Assertion

Ref	Expression
bj-tagcg	⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ {𝐴} ∈ tag 𝐵))

Proof of Theorem bj-tagcg

Step	Hyp	Ref	Expression
1		bj-snglc 37459	. 2 ⊢ (𝐴 ∈ 𝐵 ↔ {𝐴} ∈ sngl 𝐵)
2		bj-sngltag 37473	. 2 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} ∈ sngl 𝐵 ↔ {𝐴} ∈ tag 𝐵))
3	1, 2	bitrid 285	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ {𝐴} ∈ tag 𝐵))

Syntax hints:   → wi 4   ↔ wb 208   ∈ wcel 2144  {csn 4584  sngl bj-csngl 37455  tag bj-ctag 37464

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-rex 3089  df-v 3458  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4288  df-sn 4585  df-pr 4587  df-bj-sngl 37456  df-bj-tag 37465

This theorem is referenced by: (None)