Theorem fseqen 9980

Description: A set that is equinumerous to its Cartesian product is equinumerous to the set of finite sequences on it. (This can be proven more easily using some choice but this proof avoids it.) (Contributed by Mario Carneiro, 18-Nov-2014.)

Assertion

Ref	Expression
fseqen	⊢ (((𝐴 × 𝐴) ≈ 𝐴 ∧ 𝐴 ≠ ∅) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))

Distinct variable group:   𝐴,𝑛

Proof of Theorem fseqen

Dummy variables 𝑓 𝑏 𝑔 𝑘 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bren 8928	. 2 ⊢ ((𝐴 × 𝐴) ≈ 𝐴 ↔ ∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴)
2		n0 4316	. 2 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑏 𝑏 ∈ 𝐴)
3		exdistrv 1955	. . 3 ⊢ (∃𝑓∃𝑏(𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) ↔ (∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ ∃𝑏 𝑏 ∈ 𝐴))
4		omex 9596	. . . . . . 7 ⊢ ω ∈ V
5		simpl 482	. . . . . . . . 9 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → 𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴)
6		f1ofo 6807	. . . . . . . . 9 ⊢ (𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 → 𝑓:(𝐴 × 𝐴)–onto→𝐴)
7		forn 6775	. . . . . . . . 9 ⊢ (𝑓:(𝐴 × 𝐴)–onto→𝐴 → ran 𝑓 = 𝐴)
8	5, 6, 7	3syl 18	. . . . . . . 8 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → ran 𝑓 = 𝐴)
9		vex 3451	. . . . . . . . 9 ⊢ 𝑓 ∈ V
10	9	rnex 7886	. . . . . . . 8 ⊢ ran 𝑓 ∈ V
11	8, 10	eqeltrrdi 2837	. . . . . . 7 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → 𝐴 ∈ V)
12		xpexg 7726	. . . . . . 7 ⊢ ((ω ∈ V ∧ 𝐴 ∈ V) → (ω × 𝐴) ∈ V)
13	4, 11, 12	sylancr 587	. . . . . 6 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → (ω × 𝐴) ∈ V)
14		simpr 484	. . . . . . 7 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ 𝐴)
15		eqid 2729	. . . . . . 7 ⊢ seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩}) = seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})
16		eqid 2729	. . . . . . 7 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩) = (𝑥 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩)
17	11, 14, 5, 15, 16	fseqenlem2 9978	. . . . . 6 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → (𝑥 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩):∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)–1-1→(ω × 𝐴))
18		f1domg 8943	. . . . . 6 ⊢ ((ω × 𝐴) ∈ V → ((𝑥 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩):∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)–1-1→(ω × 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≼ (ω × 𝐴)))
19	13, 17, 18	sylc 65	. . . . 5 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≼ (ω × 𝐴))
20		fseqdom 9979	. . . . . 6 ⊢ (𝐴 ∈ V → (ω × 𝐴) ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
21	11, 20	syl 17	. . . . 5 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → (ω × 𝐴) ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
22		sbth 9061	. . . . 5 ⊢ ((∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≼ (ω × 𝐴) ∧ (ω × 𝐴) ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))
23	19, 21, 22	syl2anc 584	. . . 4 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))
24	23	exlimivv 1932	. . 3 ⊢ (∃𝑓∃𝑏(𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))
25	3, 24	sylbir 235	. 2 ⊢ ((∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ ∃𝑏 𝑏 ∈ 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))
26	1, 2, 25	syl2anb 598	1 ⊢ (((𝐴 × 𝐴) ≈ 𝐴 ∧ 𝐴 ≠ ∅) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109   ≠ wne 2925  Vcvv 3447  ∅c0 4296  {csn 4589  ⟨cop 4595  ∪ ciun 4955   class class class wbr 5107   ↦ cmpt 5188   × cxp 5636  dom cdm 5638  ran crn 5639   ↾ cres 5640  suc csuc 6334  –1-1→wf1 6508  –onto→wfo 6509  –1-1-onto→wf1o 6510  ‘cfv 6511  (class class class)co 7387   ∈ cmpo 7389  ωcom 7842  seq_ωcseqom 8415   ↑_m cmap 8799   ≈ cen 8915   ≼ cdom 8916

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-inf2 9594

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-seqom 8416  df-1o 8434  df-map 8801  df-en 8919  df-dom 8920

This theorem is referenced by:  infpwfien  10015