Theorem bnj548 35059

Description: Technical lemma for bnj852 35083. 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 6595	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → Fun 𝐺)
3	2	adantr 480	. . . . 5 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → Fun 𝐺)
4		bnj548.1	. . . . . . . 8 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
5	4	simp1bi 1146	. . . . . . 7 ⊢ (𝜏 → 𝑓 Fn 𝑚)
6		fndm 6597	. . . . . . . 8 ⊢ (𝑓 Fn 𝑚 → dom 𝑓 = 𝑚)
7		eleq2 2826	. . . . . . . . 9 ⊢ (dom 𝑓 = 𝑚 → (𝑖 ∈ dom 𝑓 ↔ 𝑖 ∈ 𝑚))
8	7	biimpar 477	. . . . . . . 8 ⊢ ((dom 𝑓 = 𝑚 ∧ 𝑖 ∈ 𝑚) → 𝑖 ∈ dom 𝑓)
9	6, 8	sylan 581	. . . . . . 7 ⊢ ((𝑓 Fn 𝑚 ∧ 𝑖 ∈ 𝑚) → 𝑖 ∈ dom 𝑓)
10	5, 9	sylan 581	. . . . . 6 ⊢ ((𝜏 ∧ 𝑖 ∈ 𝑚) → 𝑖 ∈ dom 𝑓)
11	10	3ad2antl2 1188	. . . . 5 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → 𝑖 ∈ dom 𝑓)
12	3, 11	jca 511	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → (Fun 𝐺 ∧ 𝑖 ∈ dom 𝑓))
13		bnj548.4	. . . . 5 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, 𝐶⟩})
14	13	bnj931 34933	. . . 4 ⊢ 𝑓 ⊆ 𝐺
15	12, 14	jctil 519	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → (𝑓 ⊆ 𝐺 ∧ (Fun 𝐺 ∧ 𝑖 ∈ dom 𝑓)))
16		3anan12 1096	. . 3 ⊢ ((Fun 𝐺 ∧ 𝑓 ⊆ 𝐺 ∧ 𝑖 ∈ dom 𝑓) ↔ (𝑓 ⊆ 𝐺 ∧ (Fun 𝐺 ∧ 𝑖 ∈ dom 𝑓)))
17	15, 16	sylibr 234	. 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → (Fun 𝐺 ∧ 𝑓 ⊆ 𝐺 ∧ 𝑖 ∈ dom 𝑓))
18		funssfv 6857	. 2 ⊢ ((Fun 𝐺 ∧ 𝑓 ⊆ 𝐺 ∧ 𝑖 ∈ dom 𝑓) → (𝐺‘𝑖) = (𝑓‘𝑖))
19		iuneq1 4951	. . . 4 ⊢ ((𝐺‘𝑖) = (𝑓‘𝑖) → ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
20	19	eqcomd 2743	. . 3 ⊢ ((𝐺‘𝑖) = (𝑓‘𝑖) → ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
21		bnj548.2	. . 3 ⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
22		bnj548.3	. . 3 ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)
23	20, 21, 22	3eqtr4g 2797	. 2 ⊢ ((𝐺‘𝑖) = (𝑓‘𝑖) → 𝐵 = 𝐾)
24	17, 18, 23	3syl 18	1 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → 𝐵 = 𝐾)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ∪ cun 3888   ⊆ wss 3890  {csn 4568  ⟨cop 4574  ∪ ciun 4934  dom cdm 5626  Fun wfun 6488   Fn wfn 6489  ‘cfv 6494   predc-bnj14 34851   FrSe w-bnj15 34855

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-pr 5372

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-id 5521  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-res 5638  df-iota 6450  df-fun 6496  df-fn 6497  df-fv 6502

This theorem is referenced by:  bnj553  35060