Theorem bnj553 35195

Description: Technical lemma for bnj852 35218. 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
bnj553.1	⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj553.2	⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj553.3	⊢ 𝐷 = (ω ∖ {∅})
bnj553.4	⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
bnj553.5	⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
bnj553.6	⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚))
bnj553.7	⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)
bnj553.8	⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
bnj553.9	⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj553.10	⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj553.11	⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
bnj553.12	⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛)

Assertion

Ref	Expression
bnj553	⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → (𝐺‘𝑚) = 𝐿)

Distinct variable groups:   𝐴,𝑖,𝑝,𝑦   𝑦,𝐺   𝑅,𝑖,𝑝,𝑦   𝑓,𝑖,𝑝,𝑦   𝑖,𝑚,𝑝   𝑝,𝜑′

Allowed substitution hints:   𝜏(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜎(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐴(𝑥,𝑓,𝑚,𝑛)   𝐵(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐶(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐷(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝑅(𝑥,𝑓,𝑚,𝑛)   𝐺(𝑥,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐾(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐿(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜑′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛)   𝜓′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)

Proof of Theorem bnj553

Step	Hyp	Ref	Expression
1		bnj553.12	. . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛)
2	1	fnfund 6624	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → Fun 𝐺)
3		opex 5433	. . . . . . 7 ⊢ ⟨𝑚, 𝐶⟩ ∈ V
4	3	snid 4623	. . . . . 6 ⊢ ⟨𝑚, 𝐶⟩ ∈ {⟨𝑚, 𝐶⟩}
5		elun2 4137	. . . . . 6 ⊢ (⟨𝑚, 𝐶⟩ ∈ {⟨𝑚, 𝐶⟩} → ⟨𝑚, 𝐶⟩ ∈ (𝑓 ∪ {⟨𝑚, 𝐶⟩}))
6	4, 5	ax-mp 5	. . . . 5 ⊢ ⟨𝑚, 𝐶⟩ ∈ (𝑓 ∪ {⟨𝑚, 𝐶⟩})
7		bnj553.8	. . . . 5 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
8	6, 7	eleqtrri 2863	. . . 4 ⊢ ⟨𝑚, 𝐶⟩ ∈ 𝐺
9		funopfv 6918	. . . 4 ⊢ (Fun 𝐺 → (⟨𝑚, 𝐶⟩ ∈ 𝐺 → (𝐺‘𝑚) = 𝐶))
10	2, 8, 9	mpisyl 21	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → (𝐺‘𝑚) = 𝐶)
11	10	3ad2ant1 1147	. 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → (𝐺‘𝑚) = 𝐶)
12		fveq2 6869	. . . . . 6 ⊢ (𝑝 = 𝑖 → (𝐺‘𝑝) = (𝐺‘𝑖))
13	12	bnj1113 35083	. . . . 5 ⊢ (𝑝 = 𝑖 → ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
14		bnj553.11	. . . . 5 ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅)
15		bnj553.10	. . . . 5 ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
16	13, 14, 15	3eqtr4g 2824	. . . 4 ⊢ (𝑝 = 𝑖 → 𝐿 = 𝐾)
17	16	3ad2ant3 1149	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐿 = 𝐾)
18		bnj553.5	. . . . 5 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
19		bnj553.9	. . . . 5 ⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
20		bnj553.4	. . . . 5 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
21	18, 19, 15, 20, 1	bnj548 35194	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → 𝐵 = 𝐾)
22	21	3adant3 1146	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐵 = 𝐾)
23		fveq2 6869	. . . . . 6 ⊢ (𝑝 = 𝑖 → (𝑓‘𝑝) = (𝑓‘𝑖))
24	23	bnj1113 35083	. . . . 5 ⊢ (𝑝 = 𝑖 → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
25		bnj553.7	. . . . . . 7 ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)
26	19, 25	eqeq12i 2782	. . . . . 6 ⊢ (𝐵 = 𝐶 ↔ ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅))
27		eqcom 2771	. . . . . 6 ⊢ (∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ↔ ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
28	26, 27	bitri 277	. . . . 5 ⊢ (𝐵 = 𝐶 ↔ ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
29	24, 28	sylibr 236	. . . 4 ⊢ (𝑝 = 𝑖 → 𝐵 = 𝐶)
30	29	3ad2ant3 1149	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐵 = 𝐶)
31	17, 22, 30	3eqtr2rd 2806	. 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐶 = 𝐿)
32	11, 31	eqtrd 2799	1 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → (𝐺‘𝑚) = 𝐿)

Syntax hints:   → wi 4   ↔ wb 208   ∧ w3a 1099   = wceq 1562   ∈ wcel 2144  ∀wral 3078   ∖ cdif 3903   ∪ cun 3904  ∅c0 4287  {csn 4584  ⟨cop 4590  ∪ ciun 4951  suc csuc 6350  Fun wfun 6517   Fn wfn 6518  ‘cfv 6523  ωcom 7848   predc-bnj14 34986   FrSe w-bnj15 34990

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-res 5661  df-iota 6479  df-fun 6525  df-fn 6526  df-fv 6531

This theorem is referenced by:  bnj557  35198