![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > axaci | Structured version Visualization version GIF version |
Description: Apply a choice equivalent. (Contributed by Mario Carneiro, 17-May-2015.) |
Ref | Expression |
---|---|
axaci.1 | ⊢ (CHOICE ↔ ∀𝑥𝜑) |
Ref | Expression |
---|---|
axaci | ⊢ 𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | axac3 10441 | . . 3 ⊢ CHOICE | |
2 | axaci.1 | . . 3 ⊢ (CHOICE ↔ ∀𝑥𝜑) | |
3 | 1, 2 | mpbi 229 | . 2 ⊢ ∀𝑥𝜑 |
4 | 3 | spi 2177 | 1 ⊢ 𝜑 |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∀wal 1539 CHOICEwac 10092 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-ac2 10440 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-fv 6540 df-ac 10093 |
This theorem is referenced by: ac7 10450 ac4 10452 ac5 10454 ac8 10469 weth 10472 |
Copyright terms: Public domain | W3C validator |