Theorem bj-finsumval0 37990

Description: Value of a finite sum. (Contributed by BJ, 9-Jun-2019.) (Proof shortened by AV, 5-May-2021.)

Hypotheses

Ref	Expression
bj-finsumval0.1	⊢ (𝜑 → 𝐴 ∈ CMnd)
bj-finsumval0.2	⊢ (𝜑 → 𝐼 ∈ Fin)
bj-finsumval0.3	⊢ (𝜑 → 𝐵:𝐼⟶(Base‘𝐴))

Assertion

Ref	Expression
bj-finsumval0	⊢ (𝜑 → (𝐴 FinSum 𝐵) = (℩𝑠∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))))

Distinct variable groups:   𝐴,𝑠,𝑓,𝑚,𝑛   𝐵,𝑓,𝑚,𝑛,𝑠   𝑓,𝐼,𝑛   𝜑,𝑓,𝑚,𝑠

Allowed substitution hints:   𝜑(𝑛)   𝐼(𝑚, 𝑠)

Proof of Theorem bj-finsumval0

Dummy variables 𝑡 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ov 7422	. 2 ⊢ (𝐴 FinSum 𝐵) = ( FinSum ‘⟨𝐴, 𝐵⟩)
2		df-bj-finsum 37989	. . 3 ⊢ FinSum = (𝑥 ∈ {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝑦))} ↦ (℩𝑠∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚))))
3		simpr 490	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → 𝑥 = ⟨𝐴, 𝐵⟩)
4	3	fveq2d 6889	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → (1st ‘𝑥) = (1st ‘⟨𝐴, 𝐵⟩))
5		bj-finsumval0.1	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ CMnd)
6	5	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → 𝐴 ∈ CMnd)
7		bj-finsumval0.3	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵:𝐼⟶(Base‘𝐴))
8		bj-finsumval0.2	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐼 ∈ Fin)
9	7, 8	fexd 7232	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ V)
10	9	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → 𝐵 ∈ V)
11		op1stg 8004	. . . . . . . . . 10 ⊢ ((𝐴 ∈ CMnd ∧ 𝐵 ∈ V) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
12	6, 10, 11	syl2anc 596	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
13	4, 12	eqtrd 2800	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → (1st ‘𝑥) = 𝐴)
14	3	fveq2d 6889	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → (2nd ‘𝑥) = (2nd ‘⟨𝐴, 𝐵⟩))
15		op2ndg 8005	. . . . . . . . . 10 ⊢ ((𝐴 ∈ CMnd ∧ 𝐵 ∈ V) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
16	6, 10, 15	syl2anc 596	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
17	14, 16	eqtrd 2800	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → (2nd ‘𝑥) = 𝐵)
18	17	dmeqd 5897	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → dom (2nd ‘𝑥) = dom 𝐵)
19	7	fdmd 6720	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝐵 = 𝐼)
20	19	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → dom 𝐵 = 𝐼)
21	18, 20	eqtrd 2800	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → dom (2nd ‘𝑥) = 𝐼)
22		f1oeq3 6814	. . . . . . . . . . . . . . 15 ⊢ (dom (2nd ‘𝑥) = 𝐼 → (𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ↔ 𝑓:(1...𝑚)–1-1-onto→𝐼))
23	22	biimpd 232	. . . . . . . . . . . . . 14 ⊢ (dom (2nd ‘𝑥) = 𝐼 → (𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) → 𝑓:(1...𝑚)–1-1-onto→𝐼))
24	23	ad2antll 742	. . . . . . . . . . . . 13 ⊢ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) → (𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) → 𝑓:(1...𝑚)–1-1-onto→𝐼))
25	24	adantrd 497	. . . . . . . . . . . 12 ⊢ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) → ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) → 𝑓:(1...𝑚)–1-1-onto→𝐼))
26	25	adantr 486	. . . . . . . . . . 11 ⊢ ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) → 𝑓:(1...𝑚)–1-1-onto→𝐼))
27		eqidd 2766	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → 1 = 1)
28		simprl 783	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ ((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼))) → (1st ‘𝑥) = 𝐴)
29	28	fveq2d 6889	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ ((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼))) → (+g‘(1st ‘𝑥)) = (+g‘𝐴))
30	29	adantrr 730	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (+g‘(1st ‘𝑥)) = (+g‘𝐴))
31		simprrl 793	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ ((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼))) → (2nd ‘𝑥) = 𝐵)
32	31	adantr 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ ((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼))) ∧ 𝑛 ∈ ℕ) → (2nd ‘𝑥) = 𝐵)
33	32	fveq1d 6887	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ ((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼))) ∧ 𝑛 ∈ ℕ) → ((2nd ‘𝑥)‘(𝑓‘𝑛)) = (𝐵‘(𝑓‘𝑛)))
34	33	mpteq2dva 5206	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ ((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼))) → (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))) = (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))
35	34	adantrr 730	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))) = (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))
36	27, 30, 35	seqeq123d 14068	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛)))) = seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛)))))
37		simprr 785	. . . . . . . . . . . . . . . . . 18 ⊢ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) → dom (2nd ‘𝑥) = 𝐼)
38	37	anim1ci 628	. . . . . . . . . . . . . . . . 17 ⊢ ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → (𝑚 ∈ ℕ0 ∧ dom (2nd ‘𝑥) = 𝐼))
39		hashfz1 14404	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑚 ∈ ℕ0 → (♯‘(1...𝑚)) = 𝑚)
40	39	eqcomd 2771	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑚 ∈ ℕ0 → 𝑚 = (♯‘(1...𝑚)))
41	40	ad2antrl 741	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (𝑚 ∈ ℕ0 ∧ dom (2nd ‘𝑥) = 𝐼)) → 𝑚 = (♯‘(1...𝑚)))
42		fzfid 14031	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (𝑚 ∈ ℕ0 ∧ dom (2nd ‘𝑥) = 𝐼)) → (1...𝑚) ∈ Fin)
43		19.8a 2220	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) → ∃𝑓 𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥))
44	43	adantr 486	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (𝑚 ∈ ℕ0 ∧ dom (2nd ‘𝑥) = 𝐼)) → ∃𝑓 𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥))
45		hasheqf1oi 14409	. . . . . . . . . . . . . . . . . . 19 ⊢ ((1...𝑚) ∈ Fin → (∃𝑓 𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) → (♯‘(1...𝑚)) = (♯‘dom (2nd ‘𝑥))))
46	42, 44, 45	sylc 66	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (𝑚 ∈ ℕ0 ∧ dom (2nd ‘𝑥) = 𝐼)) → (♯‘(1...𝑚)) = (♯‘dom (2nd ‘𝑥)))
47		simprr 785	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (𝑚 ∈ ℕ0 ∧ dom (2nd ‘𝑥) = 𝐼)) → dom (2nd ‘𝑥) = 𝐼)
48	47	fveq2d 6889	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (𝑚 ∈ ℕ0 ∧ dom (2nd ‘𝑥) = 𝐼)) → (♯‘dom (2nd ‘𝑥)) = (♯‘𝐼))
49	41, 46, 48	3eqtrd 2804	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (𝑚 ∈ ℕ0 ∧ dom (2nd ‘𝑥) = 𝐼)) → 𝑚 = (♯‘𝐼))
50	38, 49	sylan2 605	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → 𝑚 = (♯‘𝐼))
51	36, 50	fveq12d 6892	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚) = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))
52	51	eqeq2d 2776	. . . . . . . . . . . . . 14 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚) ↔ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))))
53	52	biimpd 232	. . . . . . . . . . . . 13 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚) → 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))))
54	53	impancom 457	. . . . . . . . . . . 12 ⊢ ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) → ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))))
55	54	com12 33	. . . . . . . . . . 11 ⊢ ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) → 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))))
56	26, 55	jcad 522	. . . . . . . . . 10 ⊢ ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) → (𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))))
57	22	biimprd 251	. . . . . . . . . . . . . 14 ⊢ (dom (2nd ‘𝑥) = 𝐼 → (𝑓:(1...𝑚)–1-1-onto→𝐼 → 𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥)))
58	57	ad2antll 742	. . . . . . . . . . . . 13 ⊢ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) → (𝑓:(1...𝑚)–1-1-onto→𝐼 → 𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥)))
59	58	adantr 486	. . . . . . . . . . . 12 ⊢ ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → (𝑓:(1...𝑚)–1-1-onto→𝐼 → 𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥)))
60	59	adantrd 497	. . . . . . . . . . 11 ⊢ ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))) → 𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥)))
61		eqidd 2766	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → 1 = 1)
62		simpl 488	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) → (1st ‘𝑥) = 𝐴)
63		tru 1574	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ⊤
64	62, 63	jctir 530	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) → ((1st ‘𝑥) = 𝐴 ∧ ⊤))
65	64	ad2antrl 741	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → ((1st ‘𝑥) = 𝐴 ∧ ⊤))
66		simpl 488	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((1st ‘𝑥) = 𝐴 ∧ ⊤) → (1st ‘𝑥) = 𝐴)
67	66	eqcomd 2771	. . . . . . . . . . . . . . . . . . 19 ⊢ (((1st ‘𝑥) = 𝐴 ∧ ⊤) → 𝐴 = (1st ‘𝑥))
68	65, 67	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → 𝐴 = (1st ‘𝑥))
69	68	fveq2d 6889	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (+g‘𝐴) = (+g‘(1st ‘𝑥)))
70		simpl 488	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼) → (2nd ‘𝑥) = 𝐵)
71	70	eqcomd 2771	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼) → 𝐵 = (2nd ‘𝑥))
72	71	ad2antll 742	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ ((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼))) → 𝐵 = (2nd ‘𝑥))
73	72	adantr 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ ((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼))) ∧ 𝑛 ∈ ℕ) → 𝐵 = (2nd ‘𝑥))
74	73	fveq1d 6887	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ ((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼))) ∧ 𝑛 ∈ ℕ) → (𝐵‘(𝑓‘𝑛)) = ((2nd ‘𝑥)‘(𝑓‘𝑛)))
75	74	adantlrr 734	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) ∧ 𝑛 ∈ ℕ) → (𝐵‘(𝑓‘𝑛)) = ((2nd ‘𝑥)‘(𝑓‘𝑛)))
76	75	mpteq2dva 5206	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))) = (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))
77	61, 69, 76	seqeq123d 14068	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛)))) = seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛)))))
78	59	impcom 413	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → 𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥))
79		simprr 785	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → 𝑚 ∈ ℕ0)
80	37	ad2antrl 741	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → dom (2nd ‘𝑥) = 𝐼)
81	78, 79, 80, 49	syl12anc 850	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → 𝑚 = (♯‘𝐼))
82	81	eqcomd 2771	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (♯‘𝐼) = 𝑚)
83	77, 82	fveq12d 6892	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)) = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚))
84	83	eqeq2d 2776	. . . . . . . . . . . . . 14 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)) ↔ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)))
85	84	biimpd 232	. . . . . . . . . . . . 13 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0)) → (𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)) → 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)))
86	85	impancom 457	. . . . . . . . . . . 12 ⊢ ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))) → ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)))
87	86	com12 33	. . . . . . . . . . 11 ⊢ ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))) → 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)))
88	60, 87	jcad 522	. . . . . . . . . 10 ⊢ ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → ((𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))) → (𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚))))
89	56, 88	impbid 215	. . . . . . . . 9 ⊢ ((((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) ∧ 𝑚 ∈ ℕ0) → ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))))
90	89	ex 418	. . . . . . . 8 ⊢ (((1st ‘𝑥) = 𝐴 ∧ ((2nd ‘𝑥) = 𝐵 ∧ dom (2nd ‘𝑥) = 𝐼)) → (𝑚 ∈ ℕ0 → ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))))))
91	13, 17, 21, 90	syl12anc 850	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → (𝑚 ∈ ℕ0 → ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼))))))
92	91	imp 412	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) ∧ 𝑚 ∈ ℕ0) → ((𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) ↔ (𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))))
93	92	exbidv 1954	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) ∧ 𝑚 ∈ ℕ0) → (∃𝑓(𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) ↔ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))))
94	93	rexbidva 3189	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → (∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚)) ↔ ∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))))
95	94	iotabidv 6524	. . 3 ⊢ ((𝜑 ∧ 𝑥 = ⟨𝐴, 𝐵⟩) → (℩𝑠∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→dom (2nd ‘𝑥) ∧ 𝑠 = (seq1((+g‘(1st ‘𝑥)), (𝑛 ∈ ℕ ↦ ((2nd ‘𝑥)‘(𝑓‘𝑛))))‘𝑚))) = (℩𝑠∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))))
96		eleq1 2853	. . . . . . . . . 10 ⊢ (𝑡 = 𝐼 → (𝑡 ∈ Fin ↔ 𝐼 ∈ Fin))
97		feq2 6688	. . . . . . . . . 10 ⊢ (𝑡 = 𝐼 → (𝐵:𝑡⟶(Base‘𝐴) ↔ 𝐵:𝐼⟶(Base‘𝐴)))
98	96, 97	anbi12d 644	. . . . . . . . 9 ⊢ (𝑡 = 𝐼 → ((𝑡 ∈ Fin ∧ 𝐵:𝑡⟶(Base‘𝐴)) ↔ (𝐼 ∈ Fin ∧ 𝐵:𝐼⟶(Base‘𝐴))))
99	98	ceqsexgv 3615	. . . . . . . 8 ⊢ (𝐼 ∈ Fin → (∃𝑡(𝑡 = 𝐼 ∧ (𝑡 ∈ Fin ∧ 𝐵:𝑡⟶(Base‘𝐴))) ↔ (𝐼 ∈ Fin ∧ 𝐵:𝐼⟶(Base‘𝐴))))
100	8, 99	syl 18	. . . . . . 7 ⊢ (𝜑 → (∃𝑡(𝑡 = 𝐼 ∧ (𝑡 ∈ Fin ∧ 𝐵:𝑡⟶(Base‘𝐴))) ↔ (𝐼 ∈ Fin ∧ 𝐵:𝐼⟶(Base‘𝐴))))
101	8, 7, 100	mpbir2and 726	. . . . . 6 ⊢ (𝜑 → ∃𝑡(𝑡 = 𝐼 ∧ (𝑡 ∈ Fin ∧ 𝐵:𝑡⟶(Base‘𝐴))))
102		exsimpr 1902	. . . . . 6 ⊢ (∃𝑡(𝑡 = 𝐼 ∧ (𝑡 ∈ Fin ∧ 𝐵:𝑡⟶(Base‘𝐴))) → ∃𝑡(𝑡 ∈ Fin ∧ 𝐵:𝑡⟶(Base‘𝐴)))
103	101, 102	syl 18	. . . . 5 ⊢ (𝜑 → ∃𝑡(𝑡 ∈ Fin ∧ 𝐵:𝑡⟶(Base‘𝐴)))
104		df-rex 3092	. . . . 5 ⊢ (∃𝑡 ∈ Fin 𝐵:𝑡⟶(Base‘𝐴) ↔ ∃𝑡(𝑡 ∈ Fin ∧ 𝐵:𝑡⟶(Base‘𝐴)))
105	103, 104	sylibr 237	. . . 4 ⊢ (𝜑 → ∃𝑡 ∈ Fin 𝐵:𝑡⟶(Base‘𝐴))
106		eleq1 2853	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ CMnd ↔ 𝐴 ∈ CMnd))
107		fveq2 6885	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (Base‘𝑦) = (Base‘𝐴))
108	107	feq3d 6694	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (𝑧:𝑡⟶(Base‘𝑦) ↔ 𝑧:𝑡⟶(Base‘𝐴)))
109	108	rexbidv 3191	. . . . . . 7 ⊢ (𝑦 = 𝐴 → (∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝑦) ↔ ∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝐴)))
110	106, 109	anbi12d 644	. . . . . 6 ⊢ (𝑦 = 𝐴 → ((𝑦 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝑦)) ↔ (𝐴 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝐴))))
111		feq1 6687	. . . . . . . 8 ⊢ (𝑧 = 𝐵 → (𝑧:𝑡⟶(Base‘𝐴) ↔ 𝐵:𝑡⟶(Base‘𝐴)))
112	111	rexbidv 3191	. . . . . . 7 ⊢ (𝑧 = 𝐵 → (∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝐴) ↔ ∃𝑡 ∈ Fin 𝐵:𝑡⟶(Base‘𝐴)))
113	112	anbi2d 642	. . . . . 6 ⊢ (𝑧 = 𝐵 → ((𝐴 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝐴)) ↔ (𝐴 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝐵:𝑡⟶(Base‘𝐴))))
114	110, 113	opelopabg 5525	. . . . 5 ⊢ ((𝐴 ∈ CMnd ∧ 𝐵 ∈ V) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝑦))} ↔ (𝐴 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝐵:𝑡⟶(Base‘𝐴))))
115	5, 9, 114	syl2anc 596	. . . 4 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝑦))} ↔ (𝐴 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝐵:𝑡⟶(Base‘𝐴))))
116	5, 105, 115	mpbir2and 726	. . 3 ⊢ (𝜑 → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ CMnd ∧ ∃𝑡 ∈ Fin 𝑧:𝑡⟶(Base‘𝑦))})
117		iotaex 6516	. . . 4 ⊢ (℩𝑠∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))) ∈ V
118	117	a1i 11	. . 3 ⊢ (𝜑 → (℩𝑠∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))) ∈ V)
119	2, 95, 116, 118	fvmptd2 7002	. 2 ⊢ (𝜑 → ( FinSum ‘⟨𝐴, 𝐵⟩) = (℩𝑠∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))))
120	1, 119	eqtrid 2812	1 ⊢ (𝜑 → (𝐴 FinSum 𝐵) = (℩𝑠∃𝑚 ∈ ℕ0 ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐼 ∧ 𝑠 = (seq1((+g‘𝐴), (𝑛 ∈ ℕ ↦ (𝐵‘(𝑓‘𝑛))))‘(♯‘𝐼)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ⊤wtru 1571  ∃wex 1812   ∈ wcel 2146  ∃wrex 3091  Vcvv 3457  ⟨cop 4597  {copab 5175   ↦ cmpt 5194  dom cdm 5663  ℩cio 6494  ⟶wf 6536  –1-1-onto→wf1o 6539  ‘cfv 6540  (class class class)co 7419  1^st c1st 7990  2^nd c2nd 7991  Fincfn 8949  1c1 11120  ℕcn 12252  ℕ₀cn0 12523  ...cfz 13555  seqcseq 14059  ♯chash 14388  Basecbs 17295  +_gcplusg 17336  CMndccmn 19898   FinSum cfinsum 37988

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11175  ax-resscn 11176  ax-1cn 11177  ax-icn 11178  ax-addcl 11179  ax-addrcl 11180  ax-mulcl 11181  ax-mulrcl 11182  ax-mulcom 11183  ax-addass 11184  ax-mulass 11185  ax-distr 11186  ax-i2m1 11187  ax-1ne0 11188  ax-1rid 11189  ax-rnegex 11190  ax-rrecex 11191  ax-cnre 11192  ax-pre-lttri 11193  ax-pre-lttrn 11194  ax-pre-ltadd 11195  ax-pre-mulgt0 11196

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-er 8700  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-card 9941  df-pnf 11264  df-mnf 11265  df-xr 11266  df-ltxr 11267  df-le 11268  df-sub 11462  df-neg 11463  df-nn 12253  df-n0 12524  df-z 12611  df-uz 12883  df-fz 13556  df-seq 14060  df-hash 14389  df-bj-finsum 37989

This theorem is used by: (None)