![]() |
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 4610 | . . . . . . 7 ⊢ (𝑦 = 𝑋 → 𝒫 𝑦 = 𝒫 𝑋) | |
2 | 1 | difeq1d 4117 | . . . . . 6 ⊢ (𝑦 = 𝑋 → (𝒫 𝑦 ∖ {∅}) = (𝒫 𝑋 ∖ {∅})) |
3 | 2 | oveq1d 7408 | . . . . 5 ⊢ (𝑦 = 𝑋 → ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴) = ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)) |
4 | 3 | raleqdv 3324 | . . . 4 ⊢ (𝑦 = 𝑋 → (∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
5 | 4 | anbi2d 629 | . . 3 ⊢ (𝑦 = 𝑋 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))) |
6 | df-acn 9919 | . . 3 ⊢ AC 𝐴 = {𝑦 ∣ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑦 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))} | |
7 | 5, 6 | elab2g 3666 | . 2 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∈ AC 𝐴 ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)))) |
8 | elex 3491 | . . 3 ⊢ (𝐴 ∈ 𝑊 → 𝐴 ∈ V) | |
9 | biid 260 | . . . 4 ⊢ ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ (𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) | |
10 | 9 | baib 536 | . . 3 ⊢ (𝐴 ∈ V → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
11 | 8, 10 | syl 17 | . 2 ⊢ (𝐴 ∈ 𝑊 → ((𝐴 ∈ V ∧ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
12 | 7, 11 | sylan9bb 510 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ∀wral 3060 Vcvv 3473 ∖ cdif 3941 ∅c0 4318 𝒫 cpw 4596 {csn 4622 ‘cfv 6532 (class class class)co 7393 ↑m cmap 8803 AC wacn 9915 |
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-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-br 5142 df-iota 6484 df-fv 6540 df-ov 7396 df-acn 9919 |
This theorem is referenced by: acni 10022 numacn 10026 finacn 10027 acndom 10028 acndom2 10031 acncc 10417 |
Copyright terms: Public domain | W3C validator |