|   | 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 10505 | . . 3 ⊢ CHOICE | |
| 2 | axaci.1 | . . 3 ⊢ (CHOICE ↔ ∀𝑥𝜑) | |
| 3 | 1, 2 | mpbi 230 | . 2 ⊢ ∀𝑥𝜑 | 
| 4 | 3 | spi 2183 | 1 ⊢ 𝜑 | 
| Colors of variables: wff setvar class | 
| Syntax hints: ↔ wb 206 ∀wal 1537 CHOICEwac 10156 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-rep 5278 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-ac2 10504 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-id 5577 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-fv 6568 df-ac 10157 | 
| This theorem is referenced by: ac7 10514 ac4 10516 ac5 10518 ac8 10533 weth 10536 ac8prim 45013 | 
| Copyright terms: Public domain | W3C validator |