Theorem bnj570 34881

Description: Technical lemma for bnj852 34897. 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.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj570.3	⊢ 𝐷 = (ω ∖ {∅})
bnj570.17	⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
bnj570.19	⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
bnj570.21	⊢ (𝜌 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖))
bnj570.24	⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj570.26	⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
bnj570.40	⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝐺 Fn 𝑛)
bnj570.30	⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Assertion

Ref	Expression
bnj570	⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → (𝐺‘suc 𝑖) = 𝐾)

Distinct variable groups:   𝑦,𝐺   𝑦,𝑓   𝑦,𝑖

Allowed substitution hints:   𝜏(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜂(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜌(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐴(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐶(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐷(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝑅(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐺(𝑓,𝑖,𝑚,𝑛,𝑝)   𝐾(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜑′(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜓′(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)

Proof of Theorem bnj570

Step	Hyp	Ref	Expression
1		bnj251 34678	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) ↔ (𝑅 FrSe 𝐴 ∧ (𝜏 ∧ (𝜂 ∧ 𝜌))))
2		bnj570.17	. . . . . 6 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
3	2	simp3bi 1147	. . . . 5 ⊢ (𝜏 → 𝜓′)
4		bnj570.21	. . . . . . . 8 ⊢ (𝜌 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖))
5	4	simp1bi 1145	. . . . . . 7 ⊢ (𝜌 → 𝑖 ∈ ω)
6	5	adantl 481	. . . . . 6 ⊢ ((𝜂 ∧ 𝜌) → 𝑖 ∈ ω)
7		bnj570.19	. . . . . . 7 ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
8	7, 4	bnj563 34719	. . . . . 6 ⊢ ((𝜂 ∧ 𝜌) → suc 𝑖 ∈ 𝑚)
9	6, 8	jca 511	. . . . 5 ⊢ ((𝜂 ∧ 𝜌) → (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑚))
10		bnj570.30	. . . . . . . 8 ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
11	10	bnj946 34750	. . . . . . 7 ⊢ (𝜓′ ↔ ∀𝑖(𝑖 ∈ ω → (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))))
12		sp 2184	. . . . . . 7 ⊢ (∀𝑖(𝑖 ∈ ω → (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) → (𝑖 ∈ ω → (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))))
13	11, 12	sylbi 217	. . . . . 6 ⊢ (𝜓′ → (𝑖 ∈ ω → (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))))
14	13	imp32 418	. . . . 5 ⊢ ((𝜓′ ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑚)) → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
15	3, 9, 14	syl2an 595	. . . 4 ⊢ ((𝜏 ∧ (𝜂 ∧ 𝜌)) → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
16	1, 15	simplbiim 504	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
17		bnj570.40	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → 𝐺 Fn 𝑛)
18	17	fnfund 6680	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂) → Fun 𝐺)
19	18	bnj721 34733	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → Fun 𝐺)
20		bnj570.26	. . . . . 6 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
21	20	bnj931 34746	. . . . 5 ⊢ 𝑓 ⊆ 𝐺
22	21	a1i 11	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → 𝑓 ⊆ 𝐺)
23		bnj667 34728	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → (𝜏 ∧ 𝜂 ∧ 𝜌))
24	2	bnj564 34720	. . . . . . 7 ⊢ (𝜏 → dom 𝑓 = 𝑚)
25		eleq2 2833	. . . . . . . 8 ⊢ (dom 𝑓 = 𝑚 → (suc 𝑖 ∈ dom 𝑓 ↔ suc 𝑖 ∈ 𝑚))
26	25	biimpar 477	. . . . . . 7 ⊢ ((dom 𝑓 = 𝑚 ∧ suc 𝑖 ∈ 𝑚) → suc 𝑖 ∈ dom 𝑓)
27	24, 8, 26	syl2an 595	. . . . . 6 ⊢ ((𝜏 ∧ (𝜂 ∧ 𝜌)) → suc 𝑖 ∈ dom 𝑓)
28	27	3impb 1115	. . . . 5 ⊢ ((𝜏 ∧ 𝜂 ∧ 𝜌) → suc 𝑖 ∈ dom 𝑓)
29	23, 28	syl 17	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → suc 𝑖 ∈ dom 𝑓)
30	19, 22, 29	bnj1502 34824	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → (𝐺‘suc 𝑖) = (𝑓‘suc 𝑖))
31	2	simp1bi 1145	. . . . . . . . 9 ⊢ (𝜏 → 𝑓 Fn 𝑚)
32		bnj252 34679	. . . . . . . . . . . . . 14 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ↔ (𝑚 ∈ 𝐷 ∧ (𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)))
33	32	simplbi 497	. . . . . . . . . . . . 13 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) → 𝑚 ∈ 𝐷)
34	7, 33	sylbi 217	. . . . . . . . . . . 12 ⊢ (𝜂 → 𝑚 ∈ 𝐷)
35		eldifi 4154	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ (ω ∖ {∅}) → 𝑚 ∈ ω)
36		bnj570.3	. . . . . . . . . . . . 13 ⊢ 𝐷 = (ω ∖ {∅})
37	35, 36	eleq2s 2862	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ 𝐷 → 𝑚 ∈ ω)
38		nnord 7911	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ ω → Ord 𝑚)
39	34, 37, 38	3syl 18	. . . . . . . . . . 11 ⊢ (𝜂 → Ord 𝑚)
40	39	adantr 480	. . . . . . . . . 10 ⊢ ((𝜂 ∧ 𝜌) → Ord 𝑚)
41	40, 8	jca 511	. . . . . . . . 9 ⊢ ((𝜂 ∧ 𝜌) → (Ord 𝑚 ∧ suc 𝑖 ∈ 𝑚))
42	31, 41	anim12i 612	. . . . . . . 8 ⊢ ((𝜏 ∧ (𝜂 ∧ 𝜌)) → (𝑓 Fn 𝑚 ∧ (Ord 𝑚 ∧ suc 𝑖 ∈ 𝑚)))
43		fndm 6682	. . . . . . . . 9 ⊢ (𝑓 Fn 𝑚 → dom 𝑓 = 𝑚)
44		elelsuc 6468	. . . . . . . . . 10 ⊢ (suc 𝑖 ∈ 𝑚 → suc 𝑖 ∈ suc 𝑚)
45		ordsucelsuc 7858	. . . . . . . . . . 11 ⊢ (Ord 𝑚 → (𝑖 ∈ 𝑚 ↔ suc 𝑖 ∈ suc 𝑚))
46	45	biimpar 477	. . . . . . . . . 10 ⊢ ((Ord 𝑚 ∧ suc 𝑖 ∈ suc 𝑚) → 𝑖 ∈ 𝑚)
47	44, 46	sylan2 592	. . . . . . . . 9 ⊢ ((Ord 𝑚 ∧ suc 𝑖 ∈ 𝑚) → 𝑖 ∈ 𝑚)
48	43, 47	anim12i 612	. . . . . . . 8 ⊢ ((𝑓 Fn 𝑚 ∧ (Ord 𝑚 ∧ suc 𝑖 ∈ 𝑚)) → (dom 𝑓 = 𝑚 ∧ 𝑖 ∈ 𝑚))
49		eleq2 2833	. . . . . . . . 9 ⊢ (dom 𝑓 = 𝑚 → (𝑖 ∈ dom 𝑓 ↔ 𝑖 ∈ 𝑚))
50	49	biimpar 477	. . . . . . . 8 ⊢ ((dom 𝑓 = 𝑚 ∧ 𝑖 ∈ 𝑚) → 𝑖 ∈ dom 𝑓)
51	42, 48, 50	3syl 18	. . . . . . 7 ⊢ ((𝜏 ∧ (𝜂 ∧ 𝜌)) → 𝑖 ∈ dom 𝑓)
52	51	3impb 1115	. . . . . 6 ⊢ ((𝜏 ∧ 𝜂 ∧ 𝜌) → 𝑖 ∈ dom 𝑓)
53	23, 52	syl 17	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → 𝑖 ∈ dom 𝑓)
54	19, 22, 53	bnj1502 34824	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → (𝐺‘𝑖) = (𝑓‘𝑖))
55	54	iuneq1d 5042	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
56	16, 30, 55	3eqtr4d 2790	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
57		bnj570.24	. 2 ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
58	56, 57	eqtr4di 2798	1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜌) → (𝐺‘suc 𝑖) = 𝐾)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087  ∀wal 1535   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ∀wral 3067   ∖ cdif 3973   ∪ cun 3974   ⊆ wss 3976  ∅c0 4352  {csn 4648  ⟨cop 4654  ∪ ciun 5015  dom cdm 5700  Ord word 6394  suc csuc 6397  Fun wfun 6567   Fn wfn 6568  ‘cfv 6573  ωcom 7903   ∧ w-bnj17 34662   predc-bnj14 34664   FrSe w-bnj15 34668

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-res 5712  df-ord 6398  df-on 6399  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-fv 6581  df-om 7904  df-bnj17 34663

This theorem is referenced by:  bnj571  34882