ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cc1 GIF version

Theorem cc1 7484
Description: Countable choice in terms of a choice function on a countably infinite set of inhabited sets. (Contributed by Jim Kingdon, 27-Apr-2024.)
Assertion
Ref Expression
cc1 (CCHOICE → ∀𝑥((𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧) → ∃𝑓𝑧𝑥 (𝑓𝑧) ∈ 𝑧))
Distinct variable groups:   𝑤,𝑓,𝑧   𝑥,𝑓,𝑧

Proof of Theorem cc1
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 simpl 109 . . . . . 6 ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧)) → CCHOICE)
2 simprl 531 . . . . . 6 ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧)) → 𝑥 ≈ ω)
3 simprr 533 . . . . . . 7 ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧)) → ∀𝑧𝑥𝑤 𝑤𝑧)
4 elequ2 2207 . . . . . . . . 9 (𝑧 = 𝑎 → (𝑤𝑧𝑤𝑎))
54exbidv 1873 . . . . . . . 8 (𝑧 = 𝑎 → (∃𝑤 𝑤𝑧 ↔ ∃𝑤 𝑤𝑎))
65cbvralvw 2771 . . . . . . 7 (∀𝑧𝑥𝑤 𝑤𝑧 ↔ ∀𝑎𝑥𝑤 𝑤𝑎)
73, 6sylib 122 . . . . . 6 ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧)) → ∀𝑎𝑥𝑤 𝑤𝑎)
81, 2, 7ccfunen 7483 . . . . 5 ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧)) → ∃𝑓(𝑓 Fn 𝑥 ∧ ∀𝑎𝑥 (𝑓𝑎) ∈ 𝑎))
9 exsimpr 1666 . . . . 5 (∃𝑓(𝑓 Fn 𝑥 ∧ ∀𝑎𝑥 (𝑓𝑎) ∈ 𝑎) → ∃𝑓𝑎𝑥 (𝑓𝑎) ∈ 𝑎)
108, 9syl 14 . . . 4 ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧)) → ∃𝑓𝑎𝑥 (𝑓𝑎) ∈ 𝑎)
11 fveq2 5639 . . . . . . 7 (𝑎 = 𝑧 → (𝑓𝑎) = (𝑓𝑧))
12 id 19 . . . . . . 7 (𝑎 = 𝑧𝑎 = 𝑧)
1311, 12eleq12d 2302 . . . . . 6 (𝑎 = 𝑧 → ((𝑓𝑎) ∈ 𝑎 ↔ (𝑓𝑧) ∈ 𝑧))
1413cbvralvw 2771 . . . . 5 (∀𝑎𝑥 (𝑓𝑎) ∈ 𝑎 ↔ ∀𝑧𝑥 (𝑓𝑧) ∈ 𝑧)
1514exbii 1653 . . . 4 (∃𝑓𝑎𝑥 (𝑓𝑎) ∈ 𝑎 ↔ ∃𝑓𝑧𝑥 (𝑓𝑧) ∈ 𝑧)
1610, 15sylib 122 . . 3 ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧)) → ∃𝑓𝑧𝑥 (𝑓𝑧) ∈ 𝑧)
1716ex 115 . 2 (CCHOICE → ((𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧) → ∃𝑓𝑧𝑥 (𝑓𝑧) ∈ 𝑧))
1817alrimiv 1922 1 (CCHOICE → ∀𝑥((𝑥 ≈ ω ∧ ∀𝑧𝑥𝑤 𝑤𝑧) → ∃𝑓𝑧𝑥 (𝑓𝑧) ∈ 𝑧))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1395  wex 1540  wcel 2202  wral 2510   class class class wbr 4088  ωcom 4688   Fn wfn 5321  cfv 5326  cen 6907  CCHOICEwacc 7481
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-en 6910  df-cc 7482
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator