Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ac4c | Structured version Visualization version GIF version |
Description: Equivalent of Axiom of Choice (class version). (Contributed by NM, 10-Feb-1997.) |
Ref | Expression |
---|---|
ac4c.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
ac4c | ⊢ ∃𝑓∀𝑥 ∈ 𝐴 (𝑥 ≠ ∅ → (𝑓‘𝑥) ∈ 𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ac4c.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | raleq 3316 | . . 3 ⊢ (𝑦 = 𝐴 → (∀𝑥 ∈ 𝑦 (𝑥 ≠ ∅ → (𝑓‘𝑥) ∈ 𝑥) ↔ ∀𝑥 ∈ 𝐴 (𝑥 ≠ ∅ → (𝑓‘𝑥) ∈ 𝑥))) | |
3 | 2 | exbidv 1929 | . 2 ⊢ (𝑦 = 𝐴 → (∃𝑓∀𝑥 ∈ 𝑦 (𝑥 ≠ ∅ → (𝑓‘𝑥) ∈ 𝑥) ↔ ∃𝑓∀𝑥 ∈ 𝐴 (𝑥 ≠ ∅ → (𝑓‘𝑥) ∈ 𝑥))) |
4 | ac4 10086 | . 2 ⊢ ∃𝑓∀𝑥 ∈ 𝑦 (𝑥 ≠ ∅ → (𝑓‘𝑥) ∈ 𝑥) | |
5 | 1, 3, 4 | vtocl 3471 | 1 ⊢ ∃𝑓∀𝑥 ∈ 𝐴 (𝑥 ≠ ∅ → (𝑓‘𝑥) ∈ 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1543 ∃wex 1787 ∈ wcel 2110 ≠ wne 2939 ∀wral 3058 Vcvv 3405 ∅c0 4234 ‘cfv 6377 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-rep 5176 ax-sep 5189 ax-nul 5196 ax-pow 5255 ax-pr 5319 ax-un 7520 ax-ac2 10074 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2940 df-ral 3063 df-rex 3064 df-reu 3065 df-rab 3067 df-v 3407 df-sbc 3692 df-csb 3809 df-dif 3866 df-un 3868 df-in 3870 df-ss 3880 df-nul 4235 df-if 4437 df-pw 4512 df-sn 4539 df-pr 4541 df-op 4545 df-uni 4817 df-iun 4903 df-br 5051 df-opab 5113 df-mpt 5133 df-id 5452 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6335 df-fun 6379 df-fn 6380 df-f 6381 df-f1 6382 df-fo 6383 df-f1o 6384 df-fv 6385 df-ac 9727 |
This theorem is referenced by: axdclem2 10131 |
Copyright terms: Public domain | W3C validator |