Theorem bnj517 33891

Description: Technical lemma for bnj518 33892. 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 6891	. . . . . 6 ⊢ (𝑚 = ∅ → (𝐹‘𝑚) = (𝐹‘∅))
2		simpl2 1192	. . . . . . 7 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → 𝜑)
3		bnj517.1	. . . . . . 7 ⊢ (𝜑 ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))
4	2, 3	sylib 217	. . . . . 6 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅))
5	1, 4	sylan9eqr 2794	. . . . 5 ⊢ ((((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) ∧ 𝑚 = ∅) → (𝐹‘𝑚) = pred(𝑋, 𝐴, 𝑅))
6		bnj213 33888	. . . . 5 ⊢ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴
7	5, 6	eqsstrdi 4036	. . . 4 ⊢ ((((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) ∧ 𝑚 = ∅) → (𝐹‘𝑚) ⊆ 𝐴)
8		bnj517.2	. . . . . . 7 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))
9		r19.29r 3116	. . . . . . . . . 10 ⊢ ((∃𝑖 ∈ ω 𝑚 = suc 𝑖 ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) → ∃𝑖 ∈ ω (𝑚 = suc 𝑖 ∧ (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))))
10		eleq1 2821	. . . . . . . . . . . . . 14 ⊢ (𝑚 = suc 𝑖 → (𝑚 ∈ 𝑁 ↔ suc 𝑖 ∈ 𝑁))
11	10	biimpd 228	. . . . . . . . . . . . 13 ⊢ (𝑚 = suc 𝑖 → (𝑚 ∈ 𝑁 → suc 𝑖 ∈ 𝑁))
12		fveqeq2 6900	. . . . . . . . . . . . . 14 ⊢ (𝑚 = suc 𝑖 → ((𝐹‘𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))
13		bnj213 33888	. . . . . . . . . . . . . . . . 17 ⊢ pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
14	13	rgenw 3065	. . . . . . . . . . . . . . . 16 ⊢ ∀𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
15		iunss 5048	. . . . . . . . . . . . . . . 16 ⊢ (∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴 ↔ ∀𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴)
16	14, 15	mpbir 230	. . . . . . . . . . . . . . 15 ⊢ ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
17		sseq1 4007	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) → ((𝐹‘𝑚) ⊆ 𝐴 ↔ ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴))
18	16, 17	mpbiri 257	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) → (𝐹‘𝑚) ⊆ 𝐴)
19	12, 18	syl6bir 253	. . . . . . . . . . . . 13 ⊢ (𝑚 = suc 𝑖 → ((𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) → (𝐹‘𝑚) ⊆ 𝐴))
20	11, 19	imim12d 81	. . . . . . . . . . . 12 ⊢ (𝑚 = suc 𝑖 → ((suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴)))
21	20	imp 407	. . . . . . . . . . 11 ⊢ ((𝑚 = suc 𝑖 ∧ (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴))
22	21	rexlimivw 3151	. . . . . . . . . 10 ⊢ (∃𝑖 ∈ ω (𝑚 = suc 𝑖 ∧ (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴))
23	9, 22	syl 17	. . . . . . . . 9 ⊢ ((∃𝑖 ∈ ω 𝑚 = suc 𝑖 ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴))
24	23	ex 413	. . . . . . . 8 ⊢ (∃𝑖 ∈ ω 𝑚 = suc 𝑖 → (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) → (𝑚 ∈ 𝑁 → (𝐹‘𝑚) ⊆ 𝐴)))
25	24	com3l 89	. . . . . . 7 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) → (𝑚 ∈ 𝑁 → (∃𝑖 ∈ ω 𝑚 = suc 𝑖 → (𝐹‘𝑚) ⊆ 𝐴)))
26	8, 25	sylbi 216	. . . . . 6 ⊢ (𝜓 → (𝑚 ∈ 𝑁 → (∃𝑖 ∈ ω 𝑚 = suc 𝑖 → (𝐹‘𝑚) ⊆ 𝐴)))
27	26	3ad2ant3 1135	. . . . 5 ⊢ ((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) → (𝑚 ∈ 𝑁 → (∃𝑖 ∈ ω 𝑚 = suc 𝑖 → (𝐹‘𝑚) ⊆ 𝐴)))
28	27	imp31 418	. . . 4 ⊢ ((((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) ∧ ∃𝑖 ∈ ω 𝑚 = suc 𝑖) → (𝐹‘𝑚) ⊆ 𝐴)
29		simpr 485	. . . . . 6 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → 𝑚 ∈ 𝑁)
30		simpl1 1191	. . . . . 6 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → 𝑁 ∈ ω)
31		elnn 7865	. . . . . 6 ⊢ ((𝑚 ∈ 𝑁 ∧ 𝑁 ∈ ω) → 𝑚 ∈ ω)
32	29, 30, 31	syl2anc 584	. . . . 5 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → 𝑚 ∈ ω)
33		nn0suc 7885	. . . . 5 ⊢ (𝑚 ∈ ω → (𝑚 = ∅ ∨ ∃𝑖 ∈ ω 𝑚 = suc 𝑖))
34	32, 33	syl 17	. . . 4 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → (𝑚 = ∅ ∨ ∃𝑖 ∈ ω 𝑚 = suc 𝑖))
35	7, 28, 34	mpjaodan 957	. . 3 ⊢ (((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑚 ∈ 𝑁) → (𝐹‘𝑚) ⊆ 𝐴)
36	35	ralrimiva 3146	. 2 ⊢ ((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) → ∀𝑚 ∈ 𝑁 (𝐹‘𝑚) ⊆ 𝐴)
37		fveq2 6891	. . . 4 ⊢ (𝑚 = 𝑛 → (𝐹‘𝑚) = (𝐹‘𝑛))
38	37	sseq1d 4013	. . 3 ⊢ (𝑚 = 𝑛 → ((𝐹‘𝑚) ⊆ 𝐴 ↔ (𝐹‘𝑛) ⊆ 𝐴))
39	38	cbvralvw 3234	. 2 ⊢ (∀𝑚 ∈ 𝑁 (𝐹‘𝑚) ⊆ 𝐴 ↔ ∀𝑛 ∈ 𝑁 (𝐹‘𝑛) ⊆ 𝐴)
40	36, 39	sylib 217	1 ⊢ ((𝑁 ∈ ω ∧ 𝜑 ∧ 𝜓) → ∀𝑛 ∈ 𝑁 (𝐹‘𝑛) ⊆ 𝐴)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3061  ∃wrex 3070   ⊆ wss 3948  ∅c0 4322  ∪ ciun 4997  suc csuc 6366  ‘cfv 6543  ωcom 7854   predc-bnj14 33694

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7724

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-tr 5266  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fv 6551  df-om 7855  df-bnj14 33695

This theorem is referenced by:  bnj518  33892