Theorem dfss 3234

Description: Variant of subclass definition df-ss 3233. (Contributed by NM, 3-Sep-2004.)

Assertion

Ref	Expression
dfss	⊢ (𝐴 ⊆ 𝐵 ↔ 𝐴 = (𝐴 ∩ 𝐵))

Proof of Theorem dfss

Step	Hyp	Ref	Expression
1		df-ss 3233	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴)
2		eqcom 2240	. 2 ⊢ ((𝐴 ∩ 𝐵) = 𝐴 ↔ 𝐴 = (𝐴 ∩ 𝐵))
3	1, 2	bitri 184	1 ⊢ (𝐴 ⊆ 𝐵 ↔ 𝐴 = (𝐴 ∩ 𝐵))

This proof depends on syntax axioms:   ↔ wb 105   = wceq 1402   ∩ cin 3219   ⊆ wss 3220

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-gen 1502  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-cleq 2231  df-ss 3233

This theorem is used by:  ssalel  3235  onelini  4575  cnvcnv  5240  funimass1  5458  sbthlemi5  7278  dmaddpi  7692  dmmulpi  7693  hashfibc  11285  tgioo  15657