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

Theorem axcc2 10359
Description: A possibly more useful version of ax-cc using sequences instead of countable sets. The Axiom of Infinity is needed to prove this, and indeed this implies the Axiom of Infinity. (Contributed by Mario Carneiro, 8-Feb-2013.)
Assertion
Ref Expression
axcc2 𝑔(𝑔 Fn ω ∧ ∀𝑛 ∈ ω ((𝐹𝑛) ≠ ∅ → (𝑔𝑛) ∈ (𝐹𝑛)))
Distinct variable group:   𝑔,𝐹,𝑛

Proof of Theorem axcc2
Dummy variables 𝑓 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfcv 2899 . . 3 𝑛if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚))
2 nfcv 2899 . . 3 𝑚if((𝐹𝑛) = ∅, {∅}, (𝐹𝑛))
3 fveqeq2 6851 . . . 4 (𝑚 = 𝑛 → ((𝐹𝑚) = ∅ ↔ (𝐹𝑛) = ∅))
4 fveq2 6842 . . . 4 (𝑚 = 𝑛 → (𝐹𝑚) = (𝐹𝑛))
53, 4ifbieq2d 4508 . . 3 (𝑚 = 𝑛 → if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)) = if((𝐹𝑛) = ∅, {∅}, (𝐹𝑛)))
61, 2, 5cbvmpt 5202 . 2 (𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚))) = (𝑛 ∈ ω ↦ if((𝐹𝑛) = ∅, {∅}, (𝐹𝑛)))
7 nfcv 2899 . . 3 𝑛({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚))
8 nfcv 2899 . . . 4 𝑚{𝑛}
9 nffvmpt1 6853 . . . 4 𝑚((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛)
108, 9nfxp 5665 . . 3 𝑚({𝑛} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛))
11 sneq 4592 . . . 4 (𝑚 = 𝑛 → {𝑚} = {𝑛})
12 fveq2 6842 . . . 4 (𝑚 = 𝑛 → ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚) = ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛))
1311, 12xpeq12d 5663 . . 3 (𝑚 = 𝑛 → ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)) = ({𝑛} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛)))
147, 10, 13cbvmpt 5202 . 2 (𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚))) = (𝑛 ∈ ω ↦ ({𝑛} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛)))
15 nfcv 2899 . . 3 𝑛(2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑚)))
16 nfcv 2899 . . . 4 𝑚2nd
17 nfcv 2899 . . . . 5 𝑚𝑓
18 nffvmpt1 6853 . . . . 5 𝑚((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛)
1917, 18nffv 6852 . . . 4 𝑚(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛))
2016, 19nffv 6852 . . 3 𝑚(2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛)))
21 2fveq3 6847 . . . 4 (𝑚 = 𝑛 → (𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑚)) = (𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛)))
2221fveq2d 6846 . . 3 (𝑚 = 𝑛 → (2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑚))) = (2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛))))
2315, 20, 22cbvmpt 5202 . 2 (𝑚 ∈ ω ↦ (2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑚)))) = (𝑛 ∈ ω ↦ (2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛))))
246, 14, 23axcc2lem 10358 1 𝑔(𝑔 Fn ω ∧ ∀𝑛 ∈ ω ((𝐹𝑛) ≠ ∅ → (𝑔𝑛) ∈ (𝐹𝑛)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wex 1781  wcel 2114  wne 2933  wral 3052  c0 4287  ifcif 4481  {csn 4582  cmpt 5181   × cxp 5630   Fn wfn 6495  cfv 6500  ωcom 7818  2nd c2nd 7942
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  ax-cc 10357
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-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-om 7819  df-2nd 7944  df-er 8645  df-en 8896
This theorem is referenced by:  axcc3  10360  acncc  10362  domtriomlem  10364
  Copyright terms: Public domain W3C validator