| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isacn | Structured version Visualization version GIF version | ||
| Description: The property of being a choice set of length 𝐴. (Contributed by Mario Carneiro, 31-Aug-2015.) |
| Ref | Expression |
|---|---|
| isacn | ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pweq 4568 | . . . . . . 7 ⊢ (𝑦 = 𝑋 → 𝒫 𝑦 = 𝒫 𝑋) | |
| 2 | 1 | difeq1d 4077 | . . . . . 6 ⊢ (𝑦 = 𝑋 → (𝒫 𝑦 ∖ {∅}) = (𝒫 𝑋 ∖ {∅})) |
| 3 | 2 | oveq1d 7373 | . . . . 5 ⊢ (𝑦 = 𝑋 → ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴) = ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)) |
| 4 | 3 | raleqdv 3296 | . . . 4 ⊢ (𝑦 = 𝑋 → (∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| 5 | 4 | anbi2d 630 | . . 3 ⊢ (𝑦 = 𝑋 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))) |
| 6 | df-acn 9854 | . . 3 ⊢ AC 𝐴 = {𝑦 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))} | |
| 7 | 5, 6 | elab2g 3635 | . 2 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∈ AC 𝐴 ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))) |
| 8 | elex 3461 | . . 3 ⊢ (𝐴 ∈ 𝑊 → 𝐴 ∈ V) | |
| 9 | biid 261 | . . . 4 ⊢ ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) | |
| 10 | 9 | baib 535 | . . 3 ⊢ (𝐴 ∈ V → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| 11 | 8, 10 | syl 17 | . 2 ⊢ (𝐴 ∈ 𝑊 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| 12 | 7, 11 | sylan9bb 509 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2113 ∀wral 3051 Vcvv 3440 ∖ cdif 3898 ∅c0 4285 𝒫 cpw 4554 {csn 4580 ‘cfv 6492 (class class class)co 7358 ↑m cmap 8763 AC wacn 9850 |
| 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 2115 ax-9 2123 ax-ext 2708 |
| 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-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-iota 6448 df-fv 6500 df-ov 7361 df-acn 9854 |
| This theorem is referenced by: acni 9955 numacn 9959 finacn 9960 acndom 9961 acndom2 9964 acncc 10350 |
| Copyright terms: Public domain | W3C validator |