Theorem bdctp 16642

Description: The unordered triple of three setvars is bounded. (Contributed by BJ, 16-Oct-2019.)

Assertion

Ref	Expression
bdctp	⊢ BOUNDED {𝑥, 𝑦, 𝑧}

Proof of Theorem bdctp

Step	Hyp	Ref	Expression
1		bdcpr 16641	. . 3 ⊢ BOUNDED {𝑥, 𝑦}
2		bdcsn 16640	. . 3 ⊢ BOUNDED {𝑧}
3	1, 2	bdcun 16632	. 2 ⊢ BOUNDED ({𝑥, 𝑦} ∪ {𝑧})
4		df-tp 3697	. 2 ⊢ {𝑥, 𝑦, 𝑧} = ({𝑥, 𝑦} ∪ {𝑧})
5	3, 4	bdceqir 16614	1 ⊢ BOUNDED {𝑥, 𝑦, 𝑧}

Syntax hints:   ∪ cun 3209  {csn 3689  {cpr 3690  {ctp 3691  BOUNDED wbdc 16610

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-5 1496  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-4 1559  ax-17 1575  ax-ial 1583  ax-ext 2214  ax-bd0 16583  ax-bdor 16586  ax-bdeq 16590  ax-bdsb 16592

This theorem depends on definitions:  df-bi 117  df-clab 2219  df-cleq 2225  df-clel 2228  df-un 3215  df-sn 3695  df-pr 3696  df-tp 3697  df-bdc 16611

This theorem is referenced by: (None)