Theorem bnj226 31999

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypothesis

Ref	Expression
bnj226.1	⊢ 𝐵 ⊆ 𝐶

Assertion

Ref	Expression
bnj226	⊢ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶

Distinct variable group:   𝑥,𝐶

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem bnj226

Step	Hyp	Ref	Expression
1		bnj226.1	. . 3 ⊢ 𝐵 ⊆ 𝐶
2	1	rgenw 3150	. 2 ⊢ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶
3		iunss 4961	. 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
4	2, 3	mpbir 233	1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶

Syntax hints:  ∀wral 3138   ⊆ wss 3935  ∪ ciun 4911

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-in 3942  df-ss 3951  df-iun 4913

This theorem is referenced by:  bnj229  32151  bnj1128  32257  bnj1145  32260