Theorem fseqen 10087

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 8967	. 2 ⊢ ((𝐴 × 𝐴) ≈ 𝐴 ↔ ∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴)
2		n0 4300	. 2 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑏 𝑏 ∈ 𝐴)
3		exdistrv 1988	. . 3 ⊢ (∃𝑓∃𝑏(𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) ↔ (∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ ∃𝑏 𝑏 ∈ 𝐴))
4		omex 9628	. . . . . . 7 ⊢ ω ∈ V
5		simpl 488	. . . . . . . . 9 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → 𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴)
6		f1ofo 6824	. . . . . . . . 9 ⊢ (𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 → 𝑓:(𝐴 × 𝐴)–onto→𝐴)
7		forn 6791	. . . . . . . . 9 ⊢ (𝑓:(𝐴 × 𝐴)–onto→𝐴 → ran 𝑓 = 𝐴)
8	5, 6, 7	3syl 19	. . . . . . . 8 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → ran 𝑓 = 𝐴)
9		vex 3455	. . . . . . . . 9 ⊢ 𝑓 ∈ V
10	9	rnex 7911	. . . . . . . 8 ⊢ ran 𝑓 ∈ V
11	8, 10	eqeltrrdi 2870	. . . . . . 7 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → 𝐴 ∈ V)
12		xpexg 7753	. . . . . . 7 ⊢ ((ω ∈ V ∧ 𝐴 ∈ V) → (ω × 𝐴) ∈ V)
13	4, 11, 12	sylancr 599	. . . . . 6 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → (ω × 𝐴) ∈ V)
14		simpr 490	. . . . . . 7 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → 𝑏 ∈ 𝐴)
15		eqid 2761	. . . . . . 7 ⊢ seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩}) = seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})
16		eqid 2761	. . . . . . 7 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩) = (𝑥 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩)
17	11, 14, 5, 15, 16	fseqenlem2 10085	. . . . . 6 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → (𝑥 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩):∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)–1-1→(ω × 𝐴))
18		f1domg 8982	. . . . . 6 ⊢ ((ω × 𝐴) ∈ V → ((𝑥 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴 ↑m suc 𝑘) ↦ ((𝑔‘(𝑦 ↾ 𝑘))𝑓(𝑦‘𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩):∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)–1-1→(ω × 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≼ (ω × 𝐴)))
19	13, 17, 18	sylc 66	. . . . 5 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≼ (ω × 𝐴))
20		fseqdom 10086	. . . . . 6 ⊢ (𝐴 ∈ V → (ω × 𝐴) ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
21	11, 20	syl 18	. . . . 5 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → (ω × 𝐴) ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
22		sbth 9100	. . . . 5 ⊢ ((∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≼ (ω × 𝐴) ∧ (ω × 𝐴) ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))
23	19, 21, 22	syl2anc 596	. . . 4 ⊢ ((𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))
24	23	exlimivv 1965	. . 3 ⊢ (∃𝑓∃𝑏(𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ 𝑏 ∈ 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))
25	3, 24	sylbir 238	. 2 ⊢ ((∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto→𝐴 ∧ ∃𝑏 𝑏 ∈ 𝐴) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))
26	1, 2, 25	syl2anb 610	1 ⊢ (((𝐴 × 𝐴) ≈ 𝐴 ∧ 𝐴 ≠ ∅) → ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ≈ (ω × 𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451  ∅c0 4279  {csn 4584  ⟨cop 4590  ∪ ciun 4951   class class class wbr 5103   ↦ cmpt 5186   × cxp 5649  dom cdm 5651  ran crn 5652   ↾ cres 5653  suc csuc 6357  –1-1→wf1 6528  –onto→wfo 6529  –1-1-onto→wf1o 6530  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  ωcom 7866  seq_ωcseqom 8441   ↑_m cmap 8831   ≈ cen 8954   ≼ cdom 8955

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-inf2 9626

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-seqom 8442  df-1o 8460  df-map 8833  df-en 8958  df-dom 8959

This theorem is used by:  infpwfien  10122