| 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 | fveq1 6877 | . . . . 5 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
| 2 | 1 | eleq2d 2846 | . . . 4 ⊢ (𝑓 = 𝐹 → ((𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ (𝑔‘𝑥) ∈ (𝐹‘𝑥))) |
| 3 | 2 | ralbidv 3185 | . . 3 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ ∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥))) |
| 4 | 3 | exbidv 1954 | . 2 ⊢ (𝑓 = 𝐹 → (∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥) ↔ ∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥))) |
| 5 | acnrcl 10045 | . . . . 5 ⊢ (𝑋 ∈ AC 𝐴 → 𝐴 ∈ V) | |
| 6 | isacn 10047 | . . . . 5 ⊢ ((𝑋 ∈ AC 𝐴 ∧ 𝐴 ∈ V) → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) | |
| 7 | 5, 6 | mpdan 700 | . . . 4 ⊢ (𝑋 ∈ AC 𝐴 → (𝑋 ∈ AC 𝐴 ↔ ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥))) |
| 8 | 7 | ibi 270 | . . 3 ⊢ (𝑋 ∈ AC 𝐴 → ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) |
| 9 | 8 | adantr 486 | . 2 ⊢ ((𝑋 ∈ AC 𝐴 ∧ 𝐹:𝐴⟶(𝒫 𝑋 ∖ {∅})) → ∀𝑓 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝑓‘𝑥)) |
| 10 | pwexg 5343 | . . . . 5 ⊢ (𝑋 ∈ AC 𝐴 → 𝒫 𝑋 ∈ V) | |
| 11 | 10 | difexd 5296 | . . . 4 ⊢ (𝑋 ∈ AC 𝐴 → (𝒫 𝑋 ∖ {∅}) ∈ V) |
| 12 | 11, 5 | elmapd 8839 | . . 3 ⊢ (𝑋 ∈ AC 𝐴 → (𝐹 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴) ↔ 𝐹:𝐴⟶(𝒫 𝑋 ∖ {∅}))) |
| 13 | 12 | biimpar 483 | . 2 ⊢ ((𝑋 ∈ AC 𝐴 ∧ 𝐹:𝐴⟶(𝒫 𝑋 ∖ {∅})) → 𝐹 ∈ ((𝒫 𝑋 ∖ {∅}) ↑m 𝐴)) |
| 14 | 4, 9, 13 | rspcdva 3577 | 1 ⊢ ((𝑋 ∈ AC 𝐴 ∧ 𝐹:𝐴⟶(𝒫 𝑋 ∖ {∅})) → ∃𝑔∀𝑥 ∈ 𝐴 (𝑔‘𝑥) ∈ (𝐹‘𝑥)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ∀wral 3076 Vcvv 3450 ∖ cdif 3896 ∅c0 4279 𝒫 cpw 4557 {csn 4584 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 ↑m cmap 8826 AC wacn 9943 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-map 8828 df-acn 9947 |
| This theorem is used by: acni2 10049 |
| Copyright terms: Public domain | W3C validator |