| 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 4545 | . . . . . . 7 ⊢ (𝑦 = 𝑋 → 𝒫 𝑦 = 𝒫 𝑋) | |
| 2 | 1 | difeq1d 4058 | . . . . . 6 ⊢ (𝑦 = 𝑋 → (𝒫 𝑦 ∖ {∅}) = (𝒫 𝑋 ∖ {∅})) |
| 3 | 2 | oveq1d 7374 | . . . . 5 ⊢ (𝑦 = 𝑋 → ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴) = ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)) |
| 4 | 3 | raleqdv 3299 | . . . 4 ⊢ (𝑦 = 𝑋 → (∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| 5 | 4 | anbi2d 637 | . . 3 ⊢ (𝑦 = 𝑋 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))) |
| 6 | df-acn 9861 | . . 3 ⊢ AC 𝐴 = {𝑦 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))} | |
| 7 | 5, 6 | elab2g 3619 | . 2 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∈ AC 𝐴 ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))) |
| 8 | elex 3454 | . . 3 ⊢ (𝐴 ∈ 𝑊 → 𝐴 ∈ V) | |
| 9 | biid 263 | . . . 4 ⊢ ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) | |
| 10 | 9 | baib 541 | . . 3 ⊢ (𝐴 ∈ V → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| 11 | 8, 10 | syl 17 | . 2 ⊢ (𝐴 ∈ 𝑊 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| 12 | 7, 11 | sylan9bb 515 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 = wceq 1548 ∃wex 1787 ∈ wcel 2121 ∀wral 3055 Vcvv 3433 ∖ cdif 3881 ∅c0 4263 𝒫 cpw 4531 {csn 4557 ‘cfv 6488 (class class class)co 7359 ↑m cmap 8767 AC wacn 9857 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-dif 3887 df-un 3889 df-ss 3901 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-br 5075 df-iota 6444 df-fv 6496 df-ov 7362 df-acn 9861 |
| This theorem is referenced by: acni 9962 numacn 9966 finacn 9967 acndom 9968 acndom2 9971 acncc 10358 |
| Copyright terms: Public domain | W3C validator |