| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ac6s5 | Structured version Visualization version GIF version | ||
| Description: Generalization of the Axiom of Choice to proper classes. 𝐵 is a collection 𝐵(𝑥) of nonempty, possible proper classes. Remark after Theorem 10.46 of [TakeutiZaring] p. 98. (Contributed by NM, 27-Mar-2006.) |
| Ref | Expression |
|---|---|
| ac6s4.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| ac6s5 | ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ac6s4.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 2 | 1 | ac6s4 10569 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)) |
| 3 | exsimpr 1901 | . 2 ⊢ (∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) | |
| 4 | 2, 3 | syl 18 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∃𝑓∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∃wex 1811 ∈ wcel 2144 ≠ wne 2955 ∀wral 3076 Vcvv 3450 ∅c0 4278 Fn wfn 6533 ‘cfv 6538 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-reg 9587 ax-inf2 9643 ax-ac2 10542 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-om 7878 df-2nd 8002 df-frecs 8300 df-wrecs 8331 df-recs 8380 df-rdg 8419 df-en 8975 df-r1 9769 df-rank 9770 df-scott 9930 df-card 10021 df-ac 10196 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |