MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fseqen Structured version   Visualization version   GIF version

Theorem fseqen 9940
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.
StepHypRef Expression
1 bren 8889 . 2 ((𝐴 × 𝐴) ≈ 𝐴 ↔ ∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto𝐴)
2 n0 4306 . 2 (𝐴 ≠ ∅ ↔ ∃𝑏 𝑏𝐴)
3 exdistrv 1955 . . 3 (∃𝑓𝑏(𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) ↔ (∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto𝐴 ∧ ∃𝑏 𝑏𝐴))
4 omex 9558 . . . . . . 7 ω ∈ V
5 simpl 482 . . . . . . . . 9 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝑓:(𝐴 × 𝐴)–1-1-onto𝐴)
6 f1ofo 6775 . . . . . . . . 9 (𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑓:(𝐴 × 𝐴)–onto𝐴)
7 forn 6743 . . . . . . . . 9 (𝑓:(𝐴 × 𝐴)–onto𝐴 → ran 𝑓 = 𝐴)
85, 6, 73syl 18 . . . . . . . 8 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → ran 𝑓 = 𝐴)
9 vex 3442 . . . . . . . . 9 𝑓 ∈ V
109rnex 7850 . . . . . . . 8 ran 𝑓 ∈ V
118, 10eqeltrrdi 2837 . . . . . . 7 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝐴 ∈ V)
12 xpexg 7690 . . . . . . 7 ((ω ∈ V ∧ 𝐴 ∈ V) → (ω × 𝐴) ∈ V)
134, 11, 12sylancr 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 𝑥)‘𝑥)⟩)
1711, 14, 5, 15, 16fseqenlem2 9938 . . . . . 6 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → (𝑥 𝑛 ∈ ω (𝐴m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴m suc 𝑘) ↦ ((𝑔‘(𝑦𝑘))𝑓(𝑦𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩): 𝑛 ∈ ω (𝐴m 𝑛)–1-1→(ω × 𝐴))
18 f1domg 8904 . . . . . 6 ((ω × 𝐴) ∈ V → ((𝑥 𝑛 ∈ ω (𝐴m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴m suc 𝑘) ↦ ((𝑔‘(𝑦𝑘))𝑓(𝑦𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩): 𝑛 ∈ ω (𝐴m 𝑛)–1-1→(ω × 𝐴) → 𝑛 ∈ ω (𝐴m 𝑛) ≼ (ω × 𝐴)))
1913, 17, 18sylc 65 . . . . 5 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝑛 ∈ ω (𝐴m 𝑛) ≼ (ω × 𝐴))
20 fseqdom 9939 . . . . . 6 (𝐴 ∈ V → (ω × 𝐴) ≼ 𝑛 ∈ ω (𝐴m 𝑛))
2111, 20syl 17 . . . . 5 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → (ω × 𝐴) ≼ 𝑛 ∈ ω (𝐴m 𝑛))
22 sbth 9021 . . . . 5 (( 𝑛 ∈ ω (𝐴m 𝑛) ≼ (ω × 𝐴) ∧ (ω × 𝐴) ≼ 𝑛 ∈ ω (𝐴m 𝑛)) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
2319, 21, 22syl2anc 584 . . . 4 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
2423exlimivv 1932 . . 3 (∃𝑓𝑏(𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
253, 24sylbir 235 . 2 ((∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto𝐴 ∧ ∃𝑏 𝑏𝐴) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
261, 2, 25syl2anb 598 1 (((𝐴 × 𝐴) ≈ 𝐴𝐴 ≠ ∅) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wex 1779  wcel 2109  wne 2925  Vcvv 3438  c0 4286  {csn 4579  cop 4585   ciun 4944   class class class wbr 5095  cmpt 5176   × cxp 5621  dom cdm 5623  ran crn 5624  cres 5625  suc csuc 6313  1-1wf1 6483  ontowfo 6484  1-1-ontowf1o 6485  cfv 6486  (class class class)co 7353  cmpo 7355  ωcom 7806  seqωcseqom 8376  m cmap 8760  cen 8876  cdom 8877
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 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-inf2 9556
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 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-seqom 8377  df-1o 8395  df-map 8762  df-en 8880  df-dom 8881
This theorem is referenced by:  infpwfien  9975
  Copyright terms: Public domain W3C validator