![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > cc1 | GIF version |
Description: Countable choice in terms of a choice function on a countably infinite set of inhabited sets. (Contributed by Jim Kingdon, 27-Apr-2024.) |
Ref | Expression |
---|---|
cc1 | ⊢ (CCHOICE → ∀𝑥((𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧) → ∃𝑓∀𝑧 ∈ 𝑥 (𝑓‘𝑧) ∈ 𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 109 | . . . . . 6 ⊢ ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧)) → CCHOICE) | |
2 | simprl 529 | . . . . . 6 ⊢ ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧)) → 𝑥 ≈ ω) | |
3 | simprr 531 | . . . . . . 7 ⊢ ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧)) → ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧) | |
4 | elequ2 2153 | . . . . . . . . 9 ⊢ (𝑧 = 𝑎 → (𝑤 ∈ 𝑧 ↔ 𝑤 ∈ 𝑎)) | |
5 | 4 | exbidv 1825 | . . . . . . . 8 ⊢ (𝑧 = 𝑎 → (∃𝑤 𝑤 ∈ 𝑧 ↔ ∃𝑤 𝑤 ∈ 𝑎)) |
6 | 5 | cbvralvw 2707 | . . . . . . 7 ⊢ (∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧 ↔ ∀𝑎 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑎) |
7 | 3, 6 | sylib 122 | . . . . . 6 ⊢ ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧)) → ∀𝑎 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑎) |
8 | 1, 2, 7 | ccfunen 7262 | . . . . 5 ⊢ ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧)) → ∃𝑓(𝑓 Fn 𝑥 ∧ ∀𝑎 ∈ 𝑥 (𝑓‘𝑎) ∈ 𝑎)) |
9 | exsimpr 1618 | . . . . 5 ⊢ (∃𝑓(𝑓 Fn 𝑥 ∧ ∀𝑎 ∈ 𝑥 (𝑓‘𝑎) ∈ 𝑎) → ∃𝑓∀𝑎 ∈ 𝑥 (𝑓‘𝑎) ∈ 𝑎) | |
10 | 8, 9 | syl 14 | . . . 4 ⊢ ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧)) → ∃𝑓∀𝑎 ∈ 𝑥 (𝑓‘𝑎) ∈ 𝑎) |
11 | fveq2 5515 | . . . . . . 7 ⊢ (𝑎 = 𝑧 → (𝑓‘𝑎) = (𝑓‘𝑧)) | |
12 | id 19 | . . . . . . 7 ⊢ (𝑎 = 𝑧 → 𝑎 = 𝑧) | |
13 | 11, 12 | eleq12d 2248 | . . . . . 6 ⊢ (𝑎 = 𝑧 → ((𝑓‘𝑎) ∈ 𝑎 ↔ (𝑓‘𝑧) ∈ 𝑧)) |
14 | 13 | cbvralvw 2707 | . . . . 5 ⊢ (∀𝑎 ∈ 𝑥 (𝑓‘𝑎) ∈ 𝑎 ↔ ∀𝑧 ∈ 𝑥 (𝑓‘𝑧) ∈ 𝑧) |
15 | 14 | exbii 1605 | . . . 4 ⊢ (∃𝑓∀𝑎 ∈ 𝑥 (𝑓‘𝑎) ∈ 𝑎 ↔ ∃𝑓∀𝑧 ∈ 𝑥 (𝑓‘𝑧) ∈ 𝑧) |
16 | 10, 15 | sylib 122 | . . 3 ⊢ ((CCHOICE ∧ (𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧)) → ∃𝑓∀𝑧 ∈ 𝑥 (𝑓‘𝑧) ∈ 𝑧) |
17 | 16 | ex 115 | . 2 ⊢ (CCHOICE → ((𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧) → ∃𝑓∀𝑧 ∈ 𝑥 (𝑓‘𝑧) ∈ 𝑧)) |
18 | 17 | alrimiv 1874 | 1 ⊢ (CCHOICE → ∀𝑥((𝑥 ≈ ω ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 𝑤 ∈ 𝑧) → ∃𝑓∀𝑧 ∈ 𝑥 (𝑓‘𝑧) ∈ 𝑧)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∀wal 1351 ∃wex 1492 ∈ wcel 2148 ∀wral 2455 class class class wbr 4003 ωcom 4589 Fn wfn 5211 ‘cfv 5216 ≈ cen 6737 CCHOICEwacc 7260 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4118 ax-sep 4121 ax-pow 4174 ax-pr 4209 ax-un 4433 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-un 3133 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-iun 3888 df-br 4004 df-opab 4065 df-mpt 4066 df-id 4293 df-xp 4632 df-rel 4633 df-cnv 4634 df-co 4635 df-dm 4636 df-rn 4637 df-res 4638 df-ima 4639 df-iota 5178 df-fun 5218 df-fn 5219 df-f 5220 df-f1 5221 df-fo 5222 df-f1o 5223 df-fv 5224 df-en 6740 df-cc 7261 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |