| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > axccd2 | Structured version Visualization version GIF version | ||
| Description: An alternative version of the axiom of countable choice. (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
| Ref | Expression |
|---|---|
| axccd2.1 | ⊢ (𝜑 → 𝐴 ≼ ω) |
| axccd2.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ ∅) |
| Ref | Expression |
|---|---|
| axccd2 | ⊢ (𝜑 → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isfinite2 9246 | . . . . 5 ⊢ (𝐴 ≺ ω → 𝐴 ∈ Fin) | |
| 2 | 1 | adantl 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → 𝐴 ∈ Fin) |
| 3 | simpr 489 | . . . 4 ⊢ (((𝜑 ∧ 𝐴 ≺ ω) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
| 4 | axccd2.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ ∅) | |
| 5 | 4 | adantlr 727 | . . . 4 ⊢ (((𝜑 ∧ 𝐴 ≺ ω) ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ ∅) |
| 6 | 2, 3, 5 | choicefi 45775 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥)) |
| 7 | simpr 489 | . . . . 5 ⊢ ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) → ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) → ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥)) |
| 9 | 8 | eximdv 1940 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → (∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥)) |
| 10 | 6, 9 | mpd 16 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) |
| 11 | axccd2.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ≼ ω) | |
| 12 | 11 | anim1i 626 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 ≺ ω) → (𝐴 ≼ ω ∧ ¬ 𝐴 ≺ ω)) |
| 13 | bren2 8968 | . . . 4 ⊢ (𝐴 ≈ ω ↔ (𝐴 ≼ ω ∧ ¬ 𝐴 ≺ ω)) | |
| 14 | 12, 13 | sylibr 237 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐴 ≺ ω) → 𝐴 ≈ ω) |
| 15 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≈ ω) → 𝐴 ≈ ω) | |
| 16 | 4 | adantlr 727 | . . . 4 ⊢ (((𝜑 ∧ 𝐴 ≈ ω) ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ ∅) |
| 17 | 15, 16 | axccd 45802 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≈ ω) → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) |
| 18 | 14, 17 | syldan 602 | . 2 ⊢ ((𝜑 ∧ ¬ 𝐴 ≺ ω) → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) |
| 19 | 10, 18 | pm2.61dan 824 | 1 ⊢ (𝜑 → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∃wex 1802 ∈ wcel 2145 ≠ wne 2960 ∀wral 3079 ∅c0 4288 class class class wbr 5105 Fn wfn 6520 ‘cfv 6525 ωcom 7850 ≈ cen 8928 ≼ cdom 8929 ≺ csdm 8930 Fincfn 8931 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cc 10407 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 |
| This theorem is referenced by: smflimlem6 47348 smfpimcc 47380 |
| Copyright terms: Public domain | W3C validator |