![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > acnrcl | Structured version Visualization version GIF version |
Description: Reverse closure for the choice set predicate. (Contributed by Mario Carneiro, 31-Aug-2015.) |
Ref | Expression |
---|---|
acnrcl | ⊢ (𝑋 ∈ AC 𝐴 → 𝐴 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ne0i 4292 | . . 3 ⊢ (𝑋 ∈ {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑥 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝑓‘𝑦))} → {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑥 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝑓‘𝑦))} ≠ ∅) | |
2 | abn0 4338 | . . . 4 ⊢ ({𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑥 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝑓‘𝑦))} ≠ ∅ ↔ ∃𝑥(𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑥 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝑓‘𝑦))) | |
3 | simpl 483 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑥 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝑓‘𝑦)) → 𝐴 ∈ V) | |
4 | 3 | exlimiv 1933 | . . . 4 ⊢ (∃𝑥(𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑥 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝑓‘𝑦)) → 𝐴 ∈ V) |
5 | 2, 4 | sylbi 216 | . . 3 ⊢ ({𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑥 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝑓‘𝑦))} ≠ ∅ → 𝐴 ∈ V) |
6 | 1, 5 | syl 17 | . 2 ⊢ (𝑋 ∈ {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑥 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝑓‘𝑦))} → 𝐴 ∈ V) |
7 | df-acn 9836 | . 2 ⊢ AC 𝐴 = {𝑥 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑥 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝑓‘𝑦))} | |
8 | 6, 7 | eleq2s 2856 | 1 ⊢ (𝑋 ∈ AC 𝐴 → 𝐴 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∃wex 1781 ∈ wcel 2106 {cab 2714 ≠ wne 2941 ∀wral 3062 Vcvv 3443 ∖ cdif 3905 ∅c0 4280 𝒫 cpw 4558 {csn 4584 ‘cfv 6493 (class class class)co 7351 ↑m cmap 8723 AC wacn 9832 |
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 2708 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-clab 2715 df-cleq 2729 df-clel 2815 df-ne 2942 df-dif 3911 df-nul 4281 df-acn 9836 |
This theorem is referenced by: acni 9939 acni2 9940 acndom2 9948 fodomacn 9950 iundom2g 10434 |
Copyright terms: Public domain | W3C validator |