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

Theorem fseqen 9949
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 8905 . 2 ((𝐴 × 𝐴) ≈ 𝐴 ↔ ∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto𝐴)
2 n0 4307 . 2 (𝐴 ≠ ∅ ↔ ∃𝑏 𝑏𝐴)
3 exdistrv 1957 . . 3 (∃𝑓𝑏(𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) ↔ (∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto𝐴 ∧ ∃𝑏 𝑏𝐴))
4 omex 9564 . . . . . . 7 ω ∈ V
5 simpl 482 . . . . . . . . 9 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝑓:(𝐴 × 𝐴)–1-1-onto𝐴)
6 f1ofo 6789 . . . . . . . . 9 (𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑓:(𝐴 × 𝐴)–onto𝐴)
7 forn 6757 . . . . . . . . 9 (𝑓:(𝐴 × 𝐴)–onto𝐴 → ran 𝑓 = 𝐴)
85, 6, 73syl 18 . . . . . . . 8 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → ran 𝑓 = 𝐴)
9 vex 3446 . . . . . . . . 9 𝑓 ∈ V
109rnex 7862 . . . . . . . 8 ran 𝑓 ∈ V
118, 10eqeltrrdi 2846 . . . . . . 7 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝐴 ∈ V)
12 xpexg 7705 . . . . . . 7 ((ω ∈ V ∧ 𝐴 ∈ V) → (ω × 𝐴) ∈ V)
134, 11, 12sylancr 588 . . . . . 6 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → (ω × 𝐴) ∈ V)
14 simpr 484 . . . . . . 7 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝑏𝐴)
15 eqid 2737 . . . . . . 7 seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴m suc 𝑘) ↦ ((𝑔‘(𝑦𝑘))𝑓(𝑦𝑘)))), {⟨∅, 𝑏⟩}) = seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴m suc 𝑘) ↦ ((𝑔‘(𝑦𝑘))𝑓(𝑦𝑘)))), {⟨∅, 𝑏⟩})
16 eqid 2737 . . . . . . 7 (𝑥 𝑛 ∈ ω (𝐴m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴m suc 𝑘) ↦ ((𝑔‘(𝑦𝑘))𝑓(𝑦𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩) = (𝑥 𝑛 ∈ ω (𝐴m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴m suc 𝑘) ↦ ((𝑔‘(𝑦𝑘))𝑓(𝑦𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩)
1711, 14, 5, 15, 16fseqenlem2 9947 . . . . . 6 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → (𝑥 𝑛 ∈ ω (𝐴m 𝑛) ↦ ⟨dom 𝑥, ((seqω((𝑘 ∈ V, 𝑔 ∈ V ↦ (𝑦 ∈ (𝐴m suc 𝑘) ↦ ((𝑔‘(𝑦𝑘))𝑓(𝑦𝑘)))), {⟨∅, 𝑏⟩})‘dom 𝑥)‘𝑥)⟩): 𝑛 ∈ ω (𝐴m 𝑛)–1-1→(ω × 𝐴))
18 f1domg 8920 . . . . . 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 9948 . . . . . 6 (𝐴 ∈ V → (ω × 𝐴) ≼ 𝑛 ∈ ω (𝐴m 𝑛))
2111, 20syl 17 . . . . 5 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → (ω × 𝐴) ≼ 𝑛 ∈ ω (𝐴m 𝑛))
22 sbth 9037 . . . . 5 (( 𝑛 ∈ ω (𝐴m 𝑛) ≼ (ω × 𝐴) ∧ (ω × 𝐴) ≼ 𝑛 ∈ ω (𝐴m 𝑛)) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
2319, 21, 22syl2anc 585 . . . 4 ((𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
2423exlimivv 1934 . . 3 (∃𝑓𝑏(𝑓:(𝐴 × 𝐴)–1-1-onto𝐴𝑏𝐴) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
253, 24sylbir 235 . 2 ((∃𝑓 𝑓:(𝐴 × 𝐴)–1-1-onto𝐴 ∧ ∃𝑏 𝑏𝐴) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
261, 2, 25syl2anb 599 1 (((𝐴 × 𝐴) ≈ 𝐴𝐴 ≠ ∅) → 𝑛 ∈ ω (𝐴m 𝑛) ≈ (ω × 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wex 1781  wcel 2114  wne 2933  Vcvv 3442  c0 4287  {csn 4582  cop 4588   ciun 4948   class class class wbr 5100  cmpt 5181   × cxp 5630  dom cdm 5632  ran crn 5633  cres 5634  suc csuc 6327  1-1wf1 6497  ontowfo 6498  1-1-ontowf1o 6499  cfv 6500  (class class class)co 7368  cmpo 7370  ωcom 7818  seqωcseqom 8388  m cmap 8775  cen 8892  cdom 8893
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-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-inf2 9562
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-seqom 8389  df-1o 8407  df-map 8777  df-en 8896  df-dom 8897
This theorem is referenced by:  infpwfien  9984
  Copyright terms: Public domain W3C validator