Theorem tpss 4807

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 4146	. 2 ⊢ (({𝐴, 𝐵} ⊆ 𝐷 ∧ {𝐶} ⊆ 𝐷) ↔ ({𝐴, 𝐵} ∪ {𝐶}) ⊆ 𝐷)
2		df-3an 1105	. . 3 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) ↔ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) ∧ 𝐶 ∈ 𝐷))
3		tpss.1	. . . . 5 ⊢ 𝐴 ∈ V
4		tpss.2	. . . . 5 ⊢ 𝐵 ∈ V
5	3, 4	prss 4791	. . . 4 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) ↔ {𝐴, 𝐵} ⊆ 𝐷)
6		tpss.3	. . . . 5 ⊢ 𝐶 ∈ V
7	6	snss 4755	. . . 4 ⊢ (𝐶 ∈ 𝐷 ↔ {𝐶} ⊆ 𝐷)
8	5, 7	anbi12i 640	. . 3 ⊢ (((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷) ∧ 𝐶 ∈ 𝐷) ↔ ({𝐴, 𝐵} ⊆ 𝐷 ∧ {𝐶} ⊆ 𝐷))
9	2, 8	bitri 278	. 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) ↔ ({𝐴, 𝐵} ⊆ 𝐷 ∧ {𝐶} ⊆ 𝐷))
10		df-tp 4599	. . 3 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶})
11	10	sseq1i 3968	. 2 ⊢ ({𝐴, 𝐵, 𝐶} ⊆ 𝐷 ↔ ({𝐴, 𝐵} ∪ {𝐶}) ⊆ 𝐷)
12	1, 9, 11	3bitr4i 306	1 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) ↔ {𝐴, 𝐵, 𝐶} ⊆ 𝐷)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2146  Vcvv 3458   ∪ cun 3906   ⊆ wss 3908  {csn 4594  {cpr 4596  {ctp 4598

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-v 3460  df-un 3913  df-ss 3925  df-sn 4595  df-pr 4597  df-tp 4599

This theorem is used by:  1cubr  27044  konigsberglem4  30643  rabren3dioph  43582  fourierdlem102  46962  fourierdlem114  46974  nnsum4primesodd  48601  nnsum4primesoddALTV  48602