Theorem setrec1lem2 9960

Description: Lemma for setrec1 9965. If a family of sets are all recursively generated by 𝐹, so is their union. In this theorem, 𝑋 is a family of sets which are all elements of 𝑌, and 𝑉 is any class. Use dfss3 3920, equivalence and equality theorems, and unissb at the end. Sandwich with applications of setrec1lem1. (Contributed by Emmett Weisz, 24-Jan-2021.) (New usage is discouraged.)

Hypotheses

Ref	Expression
setrec1lem2.1	⊢ 𝑌 = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤 ⊆ 𝑦 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑦 ⊆ 𝑧)}
setrec1lem2.2	⊢ (𝜑 → 𝑋 ∈ 𝑉)
setrec1lem2.3	⊢ (𝜑 → 𝑋 ⊆ 𝑌)

Assertion

Ref	Expression
setrec1lem2	⊢ (𝜑 → ∪ 𝑋 ∈ 𝑌)

Distinct variable groups:   𝑦,𝐹   𝑤,𝑋,𝑦   𝑧,𝑋,𝑦

Allowed substitution hints:   𝜑(𝑦, 𝑧, 𝑤)   𝐹(𝑧, 𝑤)   𝑉(𝑦, 𝑧, 𝑤)   𝑌(𝑦, 𝑧, 𝑤)

Proof of Theorem setrec1lem2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		setrec1lem2.3	. . . . . . 7 ⊢ (𝜑 → 𝑋 ⊆ 𝑌)
2		dfss3 3920	. . . . . . 7 ⊢ (𝑋 ⊆ 𝑌 ↔ ∀𝑥 ∈ 𝑋 𝑥 ∈ 𝑌)
3	1, 2	sylib 221	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 𝑥 ∈ 𝑌)
4		setrec1lem2.1	. . . . . . . 8 ⊢ 𝑌 = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤 ⊆ 𝑦 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑦 ⊆ 𝑧)}
5		vex 3455	. . . . . . . . 9 ⊢ 𝑥 ∈ V
6	5	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 𝑥 ∈ V)
7	4, 6	setrec1lem1 9959	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝑌 ↔ ∀𝑧(∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧)))
8	7	ralbidv 3186	. . . . . 6 ⊢ (𝜑 → (∀𝑥 ∈ 𝑋 𝑥 ∈ 𝑌 ↔ ∀𝑥 ∈ 𝑋 ∀𝑧(∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧)))
9	3, 8	mpbid 235	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑧(∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧))
10		ralcom4 3289	. . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑧(∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧) ↔ ∀𝑧∀𝑥 ∈ 𝑋 (∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧))
11	9, 10	sylib 221	. . . 4 ⊢ (𝜑 → ∀𝑧∀𝑥 ∈ 𝑋 (∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧))
12		nfra1 3287	. . . . . 6 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝑋 (∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧)
13		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑥∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧))
14		rsp 3251	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝑋 (∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧) → (𝑥 ∈ 𝑋 → (∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧)))
15		elssuni 4899	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ 𝑋 → 𝑥 ⊆ ∪ 𝑋)
16		sstr2 3938	. . . . . . . . . . . 12 ⊢ (𝑤 ⊆ 𝑥 → (𝑥 ⊆ ∪ 𝑋 → 𝑤 ⊆ ∪ 𝑋))
17	15, 16	syl5com 32	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝑋 → (𝑤 ⊆ 𝑥 → 𝑤 ⊆ ∪ 𝑋))
18	17	imim1d 83	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝑋 → ((𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → (𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧))))
19	18	alimdv 1949	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝑋 → (∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧))))
20	19	imim1d 83	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → ((∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧) → (∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧)))
21	14, 20	sylcom 31	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝑋 (∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧) → (𝑥 ∈ 𝑋 → (∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧)))
22	21	com23 87	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑋 (∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧) → (∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → (𝑥 ∈ 𝑋 → 𝑥 ⊆ 𝑧)))
23	12, 13, 22	ralrimd 3268	. . . . 5 ⊢ (∀𝑥 ∈ 𝑋 (∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧) → (∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∀𝑥 ∈ 𝑋 𝑥 ⊆ 𝑧))
24	23	alimi 1844	. . . 4 ⊢ (∀𝑧∀𝑥 ∈ 𝑋 (∀𝑤(𝑤 ⊆ 𝑥 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → 𝑥 ⊆ 𝑧) → ∀𝑧(∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∀𝑥 ∈ 𝑋 𝑥 ⊆ 𝑧))
25	11, 24	syl 18	. . 3 ⊢ (𝜑 → ∀𝑧(∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∀𝑥 ∈ 𝑋 𝑥 ⊆ 𝑧))
26		unissb 4901	. . . . 5 ⊢ (∪ 𝑋 ⊆ 𝑧 ↔ ∀𝑥 ∈ 𝑋 𝑥 ⊆ 𝑧)
27	26	imbi2i 339	. . . 4 ⊢ ((∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∪ 𝑋 ⊆ 𝑧) ↔ (∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∀𝑥 ∈ 𝑋 𝑥 ⊆ 𝑧))
28	27	albii 1852	. . 3 ⊢ (∀𝑧(∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∪ 𝑋 ⊆ 𝑧) ↔ ∀𝑧(∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∀𝑥 ∈ 𝑋 𝑥 ⊆ 𝑧))
29	25, 28	sylibr 237	. 2 ⊢ (𝜑 → ∀𝑧(∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∪ 𝑋 ⊆ 𝑧))
30		setrec1lem2.2	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
31	30	uniexd 7757	. . 3 ⊢ (𝜑 → ∪ 𝑋 ∈ V)
32	4, 31	setrec1lem1 9959	. 2 ⊢ (𝜑 → (∪ 𝑋 ∈ 𝑌 ↔ ∀𝑧(∀𝑤(𝑤 ⊆ ∪ 𝑋 → (𝑤 ⊆ 𝑧 → (𝐹‘𝑤) ⊆ 𝑧)) → ∪ 𝑋 ⊆ 𝑧)))
33	29, 32	mpbird 260	1 ⊢ (𝜑 → ∪ 𝑋 ∈ 𝑌)

This proof depends on syntax axioms:   → wi 4  ∀wal 1568   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077  Vcvv 3451   ⊆ wss 3899  ∪ cuni 4867  ‘cfv 6537

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-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-un 7749

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-v 3453  df-ss 3916  df-uni 4868

This theorem is used by:  setrec1lem3  9962