| 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 9210 | . . . . 5 ⊢ (𝐴 ≺ ω → 𝐴 ∈ Fin) | |
| 2 | 1 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → 𝐴 ∈ Fin) |
| 3 | simpr 484 | . . . 4 ⊢ (((𝜑 ∧ 𝐴 ≺ ω) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
| 4 | axccd2.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ ∅) | |
| 5 | 4 | adantlr 716 | . . . 4 ⊢ (((𝜑 ∧ 𝐴 ≺ ω) ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ ∅) |
| 6 | 2, 3, 5 | choicefi 45547 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥)) |
| 7 | simpr 484 | . . . . 5 ⊢ ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) → ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) | |
| 8 | 7 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) → ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥)) |
| 9 | 8 | eximdv 1919 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → (∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥)) |
| 10 | 6, 9 | mpd 15 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≺ ω) → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) |
| 11 | axccd2.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ≼ ω) | |
| 12 | 11 | anim1i 616 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 ≺ ω) → (𝐴 ≼ ω ∧ ¬ 𝐴 ≺ ω)) |
| 13 | bren2 8932 | . . . 4 ⊢ (𝐴 ≈ ω ↔ (𝐴 ≼ ω ∧ ¬ 𝐴 ≺ ω)) | |
| 14 | 12, 13 | sylibr 234 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐴 ≺ ω) → 𝐴 ≈ ω) |
| 15 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≈ ω) → 𝐴 ≈ ω) | |
| 16 | 4 | adantlr 716 | . . . 4 ⊢ (((𝜑 ∧ 𝐴 ≈ ω) ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ ∅) |
| 17 | 15, 16 | axccd 45576 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≈ ω) → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) |
| 18 | 14, 17 | syldan 592 | . 2 ⊢ ((𝜑 ∧ ¬ 𝐴 ≺ ω) → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) |
| 19 | 10, 18 | pm2.61dan 813 | 1 ⊢ (𝜑 → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∃wex 1781 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ∅c0 4287 class class class wbr 5100 Fn wfn 6495 ‘cfv 6500 ωcom 7818 ≈ cen 8892 ≼ cdom 8893 ≺ csdm 8894 Fincfn 8895 |
| 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-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-int 4905 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-pred 6267 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-ov 7371 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 |
| This theorem is referenced by: smflimlem6 47123 smfpimcc 47155 |
| Copyright terms: Public domain | W3C validator |