Theorem bnj517 35239

Description: Technical lemma for bnj518 35240. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Mario Carneiro, 22-Dec-2016.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj517.1	⊢ (𝜑 ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj517.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Assertion

Ref	Expression
bnj517	⊢ ((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) → ∀𝑛 ∈ 𝑁 (𝐹‘𝑛) ⊆ 𝐴)

Distinct variable groups:   𝑖,𝑛,𝑦,𝐴   𝑖,𝐹,𝑛   𝑖,𝑁,𝑛

Allowed substitution hints:   𝜑(𝑦,𝑖,𝑛)   𝜓(𝑦,𝑖,𝑛)   𝑅(𝑦,𝑖,𝑛)   𝐹(𝑦)   𝑁(𝑦)   𝑋(𝑦,𝑖,𝑛)

Proof of Theorem bnj517

Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6881	. . . . . 6 ⊢ (𝑚 = ∅ → (𝐹‘𝑚) = (𝐹‘∅))
2		simpl2 1209	. . . . . . 7 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → 𝜑)
3		bnj517.1	. . . . . . 7 ⊢ (𝜑 ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))
4	2, 3	sylib 221	. . . . . 6 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))
5	1, 4	sylan9eqr 2818	. . . . 5 ⊢ ((((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) ∧ 𝑚 = ∅) → (𝐹‘𝑚) = pred(𝑋, 𝐴, 𝑅))
6		bnj213 35236	. . . . 5 ⊢ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴
7	5, 6	eqsstrdi 3980	. . . 4 ⊢ ((((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) ∧ 𝑚 = ∅) → (𝐹‘𝑚) ⊆ 𝐴)
8		bnj517.2	. . . . . . 7 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))
9		r19.29r 3127	. . . . . . . . . 10 ⊢ ((∃𝑖 ∈ ω 𝑚 = suc 𝑖 ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) → ∃𝑖 ∈ ω (𝑚 = suc 𝑖 ∧ (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))))
10		eleq1 2849	. . . . . . . . . . . . . 14 ⊢ (𝑚 = suc 𝑖 → (𝑚 ∈ 𝑁 ↔ suc 𝑖 ∈ 𝑁))
11	10	biimpd 232	. . . . . . . . . . . . 13 ⊢ (𝑚 = suc 𝑖 → (𝑚 ∈ 𝑁 → suc 𝑖 ∈ 𝑁))
12		fveqeq2 6890	. . . . . . . . . . . . . 14 ⊢ (𝑚 = suc 𝑖 → ((𝐹‘𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))
13		bnj213 35236	. . . . . . . . . . . . . . . . 17 ⊢ pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
14	13	rgenw 3081	. . . . . . . . . . . . . . . 16 ⊢ ∀𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
15		iunss 5008	. . . . . . . . . . . . . . . 16 ⊢ (∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴 ↔ ∀𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴)
16	14, 15	mpbir 234	. . . . . . . . . . . . . . 15 ⊢ ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
17		sseq1 3961	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) → ((𝐹‘𝑚) ⊆ 𝐴 ↔ ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴))
18	16, 17	mpbiri 261	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) → (𝐹‘𝑚) ⊆ 𝐴)
19	12, 18	biimtrrdi 257	. . . . . . . . . . . . 13 ⊢ (𝑚 = suc 𝑖 → ((𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) → (𝐹‘𝑚) ⊆ 𝐴))
20	11, 19	imim12d 82	. . . . . . . . . . . 12 ⊢ (𝑚 = suc 𝑖 → ((suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴)))
21	20	imp 411	. . . . . . . . . . 11 ⊢ ((𝑚 = suc 𝑖 ∧ (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴))
22	21	rexlimivw 3160	. . . . . . . . . 10 ⊢ (∃𝑖 ∈ ω (𝑚 = suc 𝑖 ∧ (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴))
23	9, 22	syl 18	. . . . . . . . 9 ⊢ ((∃𝑖 ∈ ω 𝑚 = suc 𝑖 ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴))
24	23	ex 417	. . . . . . . 8 ⊢ (∃𝑖 ∈ ω 𝑚 = suc 𝑖 → (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴)))
25	24	com3l 90	. . . . . . 7 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) → (𝑚 ∈ 𝑁 → (∃𝑖 ∈ ω 𝑚 = suc 𝑖 → (𝐹‘𝑚) ⊆ 𝐴)))
26	8, 25	sylbi 220	. . . . . 6 ⊢ (𝜓 → (𝑚 ∈ 𝑁 → (∃𝑖 ∈ ω 𝑚 = suc 𝑖 → (𝐹‘𝑚) ⊆ 𝐴)))
27	26	3ad2ant3 1151	. . . . 5 ⊢ ((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) → (𝑚 ∈ 𝑁 → (∃𝑖 ∈ ω 𝑚 = suc 𝑖 → (𝐹‘𝑚) ⊆ 𝐴)))
28	27	imp31 422	. . . 4 ⊢ ((((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) ∧ ∃𝑖 ∈ ω 𝑚 = suc 𝑖) → (𝐹‘𝑚) ⊆ 𝐴)
29		simpr 489	. . . . . 6 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → 𝑚 ∈ 𝑁)
30		simpl1 1208	. . . . . 6 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → 𝑁 ∈ ω)
31		elnn 7872	. . . . . 6 ⊢ ((𝑚 ∈ 𝑁 ∧ 𝑁 ∈ ω) → 𝑚 ∈ ω)
32	29, 30, 31	syl2anc 595	. . . . 5 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → 𝑚 ∈ ω)
33		nn0suc 7890	. . . . 5 ⊢ (𝑚 ∈ ω → (𝑚 = ∅ ∨ ∃𝑖 ∈ ω 𝑚 = suc 𝑖))
34	32, 33	syl 18	. . . 4 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → (𝑚 = ∅ ∨ ∃𝑖 ∈ ω 𝑚 = suc 𝑖))
35	7, 28, 34	mpjaodan 973	. . 3 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → (𝐹‘𝑚) ⊆ 𝐴)
36	35	ralrimiva 3155	. 2 ⊢ ((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) → ∀𝑚 ∈ 𝑁 (𝐹‘𝑚) ⊆ 𝐴)
37		fveq2 6881	. . . 4 ⊢ (𝑚 = 𝑛 → (𝐹‘𝑚) = (𝐹‘𝑛))
38	37	sseq1d 3967	. . 3 ⊢ (𝑚 = 𝑛 → ((𝐹‘𝑚) ⊆ 𝐴 ↔ (𝐹‘𝑛) ⊆ 𝐴))
39	38	cbvralvw 3241	. 2 ⊢ (∀𝑚 ∈ 𝑁 (𝐹‘𝑚) ⊆ 𝐴 ↔ ∀𝑛 ∈ 𝑁 (𝐹‘𝑛) ⊆ 𝐴)
40	36, 39	sylib 221	1 ⊢ ((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) → ∀𝑛 ∈ 𝑁 (𝐹‘𝑛) ⊆ 𝐴)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∧ w3a 1101   = wceq 1568   ∈ wcel 2141  ∀wral 3077  ∃wrex 3087   ⊆ wss 3904  ∅c0 4285  ∪ ciun 4955  suc csuc 6362  ‘cfv 6536  ωcom 7861   predc-bnj14 35043

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-11 2190  ax-ext 2733  ax-sep 5256  ax-nul 5268  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-tr 5218  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fv 6544  df-om 7862  df-bnj14 35044

This theorem is referenced by:  bnj518  35240