Theorem bnj548 35527

Description: Technical lemma for bnj852 35551. 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
bnj548.1	⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
bnj548.2	⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj548.3	⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
bnj548.4	⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
bnj548.5	⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛)

Assertion

Ref	Expression
bnj548	⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → 𝐵 = 𝐾)

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

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

Proof of Theorem bnj548

Step	Hyp	Ref	Expression
1		bnj548.5	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛)
2	1	fnfund 6640	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → Fun 𝐺)
3	2	adantr 486	. . . . 5 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → Fun 𝐺)
4		bnj548.1	. . . . . . . 8 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
5	4	simp1bi 1163	. . . . . . 7 ⊢ (𝜏 → 𝑓 Fn 𝑚)
6		fndm 6642	. . . . . . . 8 ⊢ (𝑓 Fn 𝑚 → dom 𝑓 = 𝑚)
7		eleq2 2850	. . . . . . . . 9 ⊢ (dom 𝑓 = 𝑚 → (𝑖 ∈ dom 𝑓 ↔ 𝑖 ∈ 𝑚))
8	7	biimpar 483	. . . . . . . 8 ⊢ ((dom 𝑓 = 𝑚 ∧ 𝑖 ∈ 𝑚) → 𝑖 ∈ dom 𝑓)
9	6, 8	sylan 592	. . . . . . 7 ⊢ ((𝑓 Fn 𝑚 ∧ 𝑖 ∈ 𝑚) → 𝑖 ∈ dom 𝑓)
10	5, 9	sylan 592	. . . . . 6 ⊢ ((𝜏 ∧ 𝑖 ∈ 𝑚) → 𝑖 ∈ dom 𝑓)
11	10	3ad2antl2 1205	. . . . 5 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → 𝑖 ∈ dom 𝑓)
12	3, 11	jca 521	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → (Fun 𝐺 ∧ 𝑖 ∈ dom 𝑓))
13		bnj548.4	. . . . 5 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
14	13	bnj931 35401	. . . 4 ⊢ 𝑓 ⊆ 𝐺
15	12, 14	jctil 529	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → (𝑓 ⊆ 𝐺 ∧ (Fun 𝐺 ∧ 𝑖 ∈ dom 𝑓)))
16		3anan12 1112	. . 3 ⊢ ((Fun 𝐺 ∧ 𝑓 ⊆ 𝐺 ∧ 𝑖 ∈ dom 𝑓) ↔ (𝑓 ⊆ 𝐺 ∧ (Fun 𝐺 ∧ 𝑖 ∈ dom 𝑓)))
17	15, 16	sylibr 237	. 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → (Fun 𝐺 ∧ 𝑓 ⊆ 𝐺 ∧ 𝑖 ∈ dom 𝑓))
18		funssfv 6906	. 2 ⊢ ((Fun 𝐺 ∧ 𝑓 ⊆ 𝐺 ∧ 𝑖 ∈ dom 𝑓) → (𝐺‘𝑖) = (𝑓‘𝑖))
19		iuneq1 4968	. . . 4 ⊢ ((𝐺‘𝑖) = (𝑓‘𝑖) → ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
20	19	eqcomd 2767	. . 3 ⊢ ((𝐺‘𝑖) = (𝑓‘𝑖) → ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
21		bnj548.2	. . 3 ⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
22		bnj548.3	. . 3 ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
23	20, 21, 22	3eqtr4g 2821	. 2 ⊢ ((𝐺‘𝑖) = (𝑓‘𝑖) → 𝐵 = 𝐾)
24	17, 18, 23	3syl 19	1 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → 𝐵 = 𝐾)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ∪ cun 3897   ⊆ wss 3899  {csn 4584  ⟨cop 4590  ∪ ciun 4951  dom cdm 5651  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538   predc-bnj14 35319   FrSe w-bnj15 35323

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-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-res 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546

This theorem is used by:  bnj553  35528