Theorem bdxor 17033

Description: The exclusive disjunction of two bounded formulas is bounded. (Contributed by BJ, 3-Oct-2019.)

Hypotheses

Ref	Expression
bdxor.1	⊢ BOUNDED 𝜑
bdxor.2	⊢ BOUNDED 𝜓

Assertion

Ref	Expression
bdxor	⊢ BOUNDED (𝜑 ⊻ 𝜓)

Proof of Theorem bdxor

Step	Hyp	Ref	Expression
1		bdxor.1	. . . 4 ⊢ BOUNDED 𝜑
2		bdxor.2	. . . 4 ⊢ BOUNDED 𝜓
3	1, 2	ax-bdor 17013	. . 3 ⊢ BOUNDED (𝜑 ∨ 𝜓)
4	1, 2	ax-bdan 17012	. . . 4 ⊢ BOUNDED (𝜑 ∧ 𝜓)
5	4	ax-bdn 17014	. . 3 ⊢ BOUNDED ¬ (𝜑 ∧ 𝜓)
6	3, 5	ax-bdan 17012	. 2 ⊢ BOUNDED ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓))
7		df-xor 1425	. 2 ⊢ ((𝜑 ⊻ 𝜓) ↔ ((𝜑 ∨ 𝜓) ∧ ¬ (𝜑 ∧ 𝜓)))
8	6, 7	bd0r 17022	1 ⊢ BOUNDED (𝜑 ⊻ 𝜓)

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 104   ∨ wo 720   ⊻ wxo 1424  BOUNDED wbd 17009

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-bd0 17010  ax-bdan 17012  ax-bdor 17013  ax-bdn 17014

This proof depends on definitions:  df-bi 117  df-xor 1425

This theorem is used by: (None)