Theorem uniss2 4909

Description: A subclass condition on the members of two classes that implies a subclass relation on their unions. Proposition 8.6 of [TakeutiZaring] p. 59. See iunss2 5016 for a generalization to indexed unions. (Contributed by NM, 22-Mar-2004.)

Assertion

Ref	Expression
uniss2	⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∪ 𝐴 ⊆ ∪ 𝐵)

Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝐵

Allowed substitution hint:   𝐴(𝑦)

Proof of Theorem uniss2

Step	Hyp	Ref	Expression
1		ssuni 4900	. . . . 5 ⊢ ((𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝐵) → 𝑥 ⊆ ∪ 𝐵)
2	1	expcom 419	. . . 4 ⊢ (𝑦 ∈ 𝐵 → (𝑥 ⊆ 𝑦 → 𝑥 ⊆ ∪ 𝐵))
3	2	rexlimiv 3161	. . 3 ⊢ (∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → 𝑥 ⊆ ∪ 𝐵)
4	3	ralimi 3104	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∀𝑥 ∈ 𝐴 𝑥 ⊆ ∪ 𝐵)
5		unissb 4908	. 2 ⊢ (∪ 𝐴 ⊆ ∪ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ ∪ 𝐵)
6	4, 5	sylibr 237	1 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∪ 𝐴 ⊆ ∪ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091   ⊆ wss 3906  ∪ cuni 4874

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 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-v 3459  df-ss 3923  df-uni 4875

This theorem is used by:  unidif  4910  coflim  10256  onsssupeqcond  44040