Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > acni | 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 |
---|---|
acni | ⊢ ((𝑋 ∈ AC 𝐴 ∧ 𝐹:𝐴⟶(𝒫 𝑋 ∖ {∅})) → ∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pwexg 4776 | . . . . 5 ⊢ (𝑋 ∈ AC 𝐴 → 𝒫 𝑋 ∈ V) | |
2 | difexg 4735 | . . . . 5 ⊢ (𝒫 𝑋 ∈ V → (𝒫 𝑋 ∖ {∅}) ∈ V) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝑋 ∈ AC 𝐴 → (𝒫 𝑋 ∖ {∅}) ∈ V) |
4 | acnrcl 8748 | . . . 4 ⊢ (𝑋 ∈ AC 𝐴 → 𝐴 ∈ V) | |
5 | 3, 4 | elmapd 7758 | . . 3 ⊢ (𝑋 ∈ AC 𝐴 → (𝐹 ∈ ((𝒫 𝑋 ∖ {∅}) ↑𝑚 𝐴) ↔ 𝐹:𝐴⟶(𝒫 𝑋 ∖ {∅}))) |
6 | 5 | biimpar 501 | . 2 ⊢ ((𝑋 ∈ AC 𝐴 ∧ 𝐹:𝐴⟶(𝒫 𝑋 ∖ {∅})) → 𝐹 ∈ ((𝒫 𝑋 ∖ {∅}) ↑𝑚 𝐴)) |
7 | isacn 8750 | . . . . 5 ⊢ ((𝑋 ∈ AC 𝐴 ∧ 𝐴 ∈ V) → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑𝑚 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) | |
8 | 4, 7 | mpdan 699 | . . . 4 ⊢ (𝑋 ∈ AC 𝐴 → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑𝑚 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
9 | 8 | ibi 255 | . . 3 ⊢ (𝑋 ∈ AC 𝐴 → ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑𝑚 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) |
10 | 9 | adantr 480 | . 2 ⊢ ((𝑋 ∈ AC 𝐴 ∧ 𝐹:𝐴⟶(𝒫 𝑋 ∖ {∅})) → ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑𝑚 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) |
11 | fveq1 6102 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
12 | 11 | eleq2d 2673 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ (𝑔‘𝑥) ∈ (𝐹‘𝑥))) |
13 | 12 | ralbidv 2969 | . . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥))) |
14 | 13 | exbidv 1837 | . . 3 ⊢ (𝑓 = 𝐹 → (∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ ∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥))) |
15 | 14 | rspcv 3278 | . 2 ⊢ (𝐹 ∈ ((𝒫 𝑋 ∖ {∅}) ↑𝑚 𝐴) → (∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑𝑚 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥) → ∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥))) |
16 | 6, 10, 15 | sylc 63 | 1 ⊢ ((𝑋 ∈ AC 𝐴 ∧ 𝐹:𝐴⟶(𝒫 𝑋 ∖ {∅})) → ∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∃wex 1695 ∈ wcel 1977 ∀wral 2896 Vcvv 3173 ∖ cdif 3537 ∅c0 3874 𝒫 cpw 4108 {csn 4125 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 ↑𝑚 cmap 7744 AC wacn 8647 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-map 7746 df-acn 8651 |
This theorem is referenced by: acni2 8752 |
Copyright terms: Public domain | W3C validator |