Theorem iuneq0 49074

Description: An indexed union is empty iff all indexed classes are empty. (Contributed by Zhi Wang, 1-Nov-2025.)

Assertion

Ref	Expression
iuneq0	⊢ (∀𝑥 ∈ 𝐴 𝐵 = ∅ ↔ ∪ 𝑥 ∈ 𝐴 𝐵 = ∅)

Proof of Theorem iuneq0

Step	Hyp	Ref	Expression
1		iunss 5000	. 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∅ ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∅)
2		ss0b 4353	. 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∅ ↔ ∪ 𝑥 ∈ 𝐴 𝐵 = ∅)
3		ss0b 4353	. . 3 ⊢ (𝐵 ⊆ ∅ ↔ 𝐵 = ∅)
4	3	ralbii 3082	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ ∅ ↔ ∀𝑥 ∈ 𝐴 𝐵 = ∅)
5	1, 2, 4	3bitr3ri 302	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = ∅ ↔ ∪ 𝑥 ∈ 𝐴 𝐵 = ∅)

Syntax hints:   ↔ wb 206   = wceq 1541  ∀wral 3051   ⊆ wss 3901  ∅c0 4285  ∪ ciun 4946

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-11 2162  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-v 3442  df-dif 3904  df-ss 3918  df-nul 4286  df-iun 4948

This theorem is referenced by: (None)