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

Theorem axcc2 10397
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 2892 . . 3 𝑛if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚))
2 nfcv 2892 . . 3 𝑚if((𝐹𝑛) = ∅, {∅}, (𝐹𝑛))
3 fveqeq2 6870 . . . 4 (𝑚 = 𝑛 → ((𝐹𝑚) = ∅ ↔ (𝐹𝑛) = ∅))
4 fveq2 6861 . . . 4 (𝑚 = 𝑛 → (𝐹𝑚) = (𝐹𝑛))
53, 4ifbieq2d 4518 . . 3 (𝑚 = 𝑛 → if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)) = if((𝐹𝑛) = ∅, {∅}, (𝐹𝑛)))
61, 2, 5cbvmpt 5212 . 2 (𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚))) = (𝑛 ∈ ω ↦ if((𝐹𝑛) = ∅, {∅}, (𝐹𝑛)))
7 nfcv 2892 . . 3 𝑛({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚))
8 nfcv 2892 . . . 4 𝑚{𝑛}
9 nffvmpt1 6872 . . . 4 𝑚((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛)
108, 9nfxp 5674 . . 3 𝑚({𝑛} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛))
11 sneq 4602 . . . 4 (𝑚 = 𝑛 → {𝑚} = {𝑛})
12 fveq2 6861 . . . 4 (𝑚 = 𝑛 → ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚) = ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛))
1311, 12xpeq12d 5672 . . 3 (𝑚 = 𝑛 → ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)) = ({𝑛} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛)))
147, 10, 13cbvmpt 5212 . 2 (𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚))) = (𝑛 ∈ ω ↦ ({𝑛} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑛)))
15 nfcv 2892 . . 3 𝑛(2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑚)))
16 nfcv 2892 . . . 4 𝑚2nd
17 nfcv 2892 . . . . 5 𝑚𝑓
18 nffvmpt1 6872 . . . . 5 𝑚((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛)
1917, 18nffv 6871 . . . 4 𝑚(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛))
2016, 19nffv 6871 . . 3 𝑚(2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛)))
21 2fveq3 6866 . . . 4 (𝑚 = 𝑛 → (𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑚)) = (𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛)))
2221fveq2d 6865 . . 3 (𝑚 = 𝑛 → (2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑚))) = (2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛))))
2315, 20, 22cbvmpt 5212 . 2 (𝑚 ∈ ω ↦ (2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑚)))) = (𝑛 ∈ ω ↦ (2nd ‘(𝑓‘((𝑚 ∈ ω ↦ ({𝑚} × ((𝑚 ∈ ω ↦ if((𝐹𝑚) = ∅, {∅}, (𝐹𝑚)))‘𝑚)))‘𝑛))))
246, 14, 23axcc2lem 10396 1 𝑔(𝑔 Fn ω ∧ ∀𝑛 ∈ ω ((𝐹𝑛) ≠ ∅ → (𝑔𝑛) ∈ (𝐹𝑛)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wex 1779  wcel 2109  wne 2926  wral 3045  c0 4299  ifcif 4491  {csn 4592  cmpt 5191   × cxp 5639   Fn wfn 6509  cfv 6514  ωcom 7845  2nd c2nd 7970
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 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-inf2 9601  ax-cc 10395
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 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-om 7846  df-2nd 7972  df-er 8674  df-en 8922
This theorem is referenced by:  axcc3  10398  acncc  10400  domtriomlem  10402
  Copyright terms: Public domain W3C validator