Theorem 3unrab 32986

Description: Union of three restricted class abstractions. (Contributed by Thierry Arnoux, 6-Jul-2025.)

Assertion

Ref	Expression
3unrab	⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ 𝜓}) ∪ {𝑥 ∈ 𝐴 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ 𝜓 ∨ 𝜒)}

Proof of Theorem 3unrab

Step	Hyp	Ref	Expression
1		unrab 4264	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ (𝜑 ∨ 𝜓)} ∪ {𝑥 ∈ 𝐴 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ ((𝜑 ∨ 𝜓) ∨ 𝜒)}
2		unrab 4264	. . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ 𝜓}) = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ 𝜓)}
3	2	uneq1i 4114	. 2 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ 𝜓}) ∪ {𝑥 ∈ 𝐴 ∣ 𝜒}) = ({𝑥 ∈ 𝐴 ∣ (𝜑 ∨ 𝜓)} ∪ {𝑥 ∈ 𝐴 ∣ 𝜒})
4		df-3or 1104	. . 3 ⊢ ((𝜑 ∨ 𝜓 ∨ 𝜒) ↔ ((𝜑 ∨ 𝜓) ∨ 𝜒))
5	4	rabbii 3419	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ 𝜓 ∨ 𝜒)} = {𝑥 ∈ 𝐴 ∣ ((𝜑 ∨ 𝜓) ∨ 𝜒)}
6	1, 3, 5	3eqtr4i 2795	1 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ 𝜓}) ∪ {𝑥 ∈ 𝐴 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ 𝜓 ∨ 𝜒)}

This proof depends on syntax axioms:   ∨ wo 861   ∨ w3o 1102   = wceq 1570  {crab 3414   ∪ cun 3900

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 2147  ax-9 2155  ax-10 2178  ax-12 2215  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-un 3907

This theorem is used by:  constrfin  34264