| 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 10418 | . . 3 ⊢ CHOICE | |
| 2 | axaci.1 | . . 3 ⊢ (CHOICE ↔ ∀𝑥𝜑) | |
| 3 | 1, 2 | mpbi 232 | . 2 ⊢ ∀𝑥𝜑 |
| 4 | 3 | spi 2218 | 1 ⊢ 𝜑 |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∀wal 1557 CHOICEwac 10068 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-ac2 10417 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-fv 6525 df-ac 10069 |
| This theorem is referenced by: ac7 10427 ac4 10429 ac5 10431 ac8 10446 weth 10449 ac8prim 45531 |
| Copyright terms: Public domain | W3C validator |