Theorem tpss 4768

Description: An unordered triple of elements of a class is a subset of the class. (Contributed by NM, 9-Apr-1994.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)

Hypotheses

Ref	Expression
tpss.1	⊢ 𝐴 ∈ V
tpss.2	⊢ 𝐵 ∈ V
tpss.3	⊢ 𝐶 ∈ V

Assertion

Ref	Expression
tpss	⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) ↔ {𝐴, 𝐵, 𝐶} ⊆ 𝐷)

Proof of Theorem tpss

Step	Hyp	Ref	Expression
1		unss 4118	. 2 ⊢ (({𝐴, 𝐵} ⊆ 𝐷 ∧ {𝐶} ⊆ 𝐷) ↔ ({𝐴, 𝐵} ∪ {𝐶}) ⊆ 𝐷)
2		df-3an 1088	. . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) ↔ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) ∧ 𝐶 ∈ 𝐷))
3		tpss.1	. . . . 5 ⊢ 𝐴 ∈ V
4		tpss.2	. . . . 5 ⊢ 𝐵 ∈ V
5	3, 4	prss 4753	. . . 4 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) ↔ {𝐴, 𝐵} ⊆ 𝐷)
6		tpss.3	. . . . 5 ⊢ 𝐶 ∈ V
7	6	snss 4719	. . . 4 ⊢ (𝐶 ∈ 𝐷 ↔ {𝐶} ⊆ 𝐷)
8	5, 7	anbi12i 627	. . 3 ⊢ (((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) ∧ 𝐶 ∈ 𝐷) ↔ ({𝐴, 𝐵} ⊆ 𝐷 ∧ {𝐶} ⊆ 𝐷))
9	2, 8	bitri 274	. 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) ↔ ({𝐴, 𝐵} ⊆ 𝐷 ∧ {𝐶} ⊆ 𝐷))
10		df-tp 4566	. . 3 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})
11	10	sseq1i 3949	. 2 ⊢ ({𝐴, 𝐵, 𝐶} ⊆ 𝐷 ↔ ({𝐴, 𝐵} ∪ {𝐶}) ⊆ 𝐷)
12	1, 9, 11	3bitr4i 303	1 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) ↔ {𝐴, 𝐵, 𝐶} ⊆ 𝐷)

Syntax hints:   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   ∈ wcel 2106  Vcvv 3432   ∪ cun 3885   ⊆ wss 3887  {csn 4561  {cpr 4563  {ctp 4565

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-v 3434  df-un 3892  df-in 3894  df-ss 3904  df-sn 4562  df-pr 4564  df-tp 4566

This theorem is referenced by:  1cubr  25992  konigsberglem4  28619  rabren3dioph  40637  fourierdlem102  43749  fourierdlem114  43761  nnsum4primesodd  45248  nnsum4primesoddALTV  45249