| 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 10352 | . . 3 ⊢ CHOICE | |
| 2 | axaci.1 | . . 3 ⊢ (CHOICE ↔ ∀𝑥𝜑) | |
| 3 | 1, 2 | mpbi 230 | . 2 ⊢ ∀𝑥𝜑 |
| 4 | 3 | spi 2187 | 1 ⊢ 𝜑 |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∀wal 1539 CHOICEwac 10003 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-ac2 10351 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-id 5511 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-fv 6489 df-ac 10004 |
| This theorem is referenced by: ac7 10361 ac4 10363 ac5 10365 ac8 10380 weth 10383 ac8prim 45023 |
| Copyright terms: Public domain | W3C validator |