Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bd3or GIF version

Theorem bd3or 11366
Description: A disjunction of three bounded formulas is bounded. (Contributed by BJ, 3-Oct-2019.)
Hypotheses
Ref Expression
bd3or.1 BOUNDED 𝜑
bd3or.2 BOUNDED 𝜓
bd3or.3 BOUNDED 𝜒
Assertion
Ref Expression
bd3or BOUNDED (𝜑𝜓𝜒)

Proof of Theorem bd3or
StepHypRef Expression
1 bd3or.1 . . . 4 BOUNDED 𝜑
2 bd3or.2 . . . 4 BOUNDED 𝜓
31, 2ax-bdor 11353 . . 3 BOUNDED (𝜑𝜓)
4 bd3or.3 . . 3 BOUNDED 𝜒
53, 4ax-bdor 11353 . 2 BOUNDED ((𝜑𝜓) ∨ 𝜒)
6 df-3or 925 . 2 ((𝜑𝜓𝜒) ↔ ((𝜑𝜓) ∨ 𝜒))
75, 6bd0r 11362 1 BOUNDED (𝜑𝜓𝜒)
Colors of variables: wff set class
Syntax hints:  wo 664  w3o 923  BOUNDED wbd 11349
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-bd0 11350  ax-bdor 11353
This theorem depends on definitions:  df-bi 115  df-3or 925
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator