Theorem prsstp23 3749

Description: A pair is a subset of an unordered triple containing its members. (Contributed by Jim Kingdon, 11-Aug-2018.)

Assertion

Ref	Expression
prsstp23	⊢ {𝐵, 𝐶} ⊆ {𝐴, 𝐵, 𝐶}

Proof of Theorem prsstp23

Step	Hyp	Ref	Expression
1		prsstp12 3747	. 2 ⊢ {𝐵, 𝐶} ⊆ {𝐵, 𝐶, 𝐴}
2		tprot 3687	. 2 ⊢ {𝐴, 𝐵, 𝐶} = {𝐵, 𝐶, 𝐴}
3	1, 2	sseqtrri 3192	1 ⊢ {𝐵, 𝐶} ⊆ {𝐴, 𝐵, 𝐶}

Syntax hints:   ⊆ wss 3131  {cpr 3595  {ctp 3596

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3or 979  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-sn 3600  df-pr 3601  df-tp 3602

This theorem is referenced by:  sstpr  3759