Theorem bj-tagcg 37649

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 37633	. 2 ⊢ (𝐴 ∈ 𝐵 ↔ {𝐴} ∈ sngl 𝐵)
2		bj-sngltag 37647	. 2 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} ∈ sngl 𝐵 ↔ {𝐴} ∈ tag 𝐵))
3	1, 2	bitrid 286	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ {𝐴} ∈ tag 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∈ wcel 2142  {csn 4588  sngl bj-csngl 37629  tag bj-ctag 37638

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rex 3089  df-v 3456  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-sn 4589  df-pr 4591  df-bj-sngl 37630  df-bj-tag 37639

This theorem is used by: (None)