Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ac9 | Structured version Visualization version GIF version |
Description: An Axiom of Choice equivalent: the infinite Cartesian product of nonempty classes is nonempty. Axiom of Choice (second form) of [Enderton] p. 55 and its converse. (Contributed by Mario Carneiro, 22-Mar-2013.) |
Ref | Expression |
---|---|
ac6c4.1 | ⊢ 𝐴 ∈ V |
ac6c4.2 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
ac9 | ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ X𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ac6c4.1 | . . . 4 ⊢ 𝐴 ∈ V | |
2 | ac6c4.2 | . . . 4 ⊢ 𝐵 ∈ V | |
3 | 1, 2 | ac6c4 10100 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)) |
4 | n0 4266 | . . . 4 ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∃𝑓 𝑓 ∈ X𝑥 ∈ 𝐴 𝐵) | |
5 | vex 3417 | . . . . . 6 ⊢ 𝑓 ∈ V | |
6 | 5 | elixp 8590 | . . . . 5 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)) |
7 | 6 | exbii 1855 | . . . 4 ⊢ (∃𝑓 𝑓 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)) |
8 | 4, 7 | bitr2i 279 | . . 3 ⊢ (∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) ↔ X𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
9 | 3, 8 | sylib 221 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → X𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
10 | ixpn0 8616 | . 2 ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) | |
11 | 9, 10 | impbii 212 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ X𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∃wex 1787 ∈ wcel 2110 ≠ wne 2940 ∀wral 3061 Vcvv 3413 ∅c0 4242 Fn wfn 6380 ‘cfv 6385 Xcixp 8583 |
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 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-rep 5184 ax-sep 5197 ax-nul 5204 ax-pow 5263 ax-pr 5327 ax-un 7528 ax-ac2 10082 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3415 df-sbc 3700 df-csb 3817 df-dif 3874 df-un 3876 df-in 3878 df-ss 3888 df-pss 3890 df-nul 4243 df-if 4445 df-pw 4520 df-sn 4547 df-pr 4549 df-tp 4551 df-op 4553 df-uni 4825 df-int 4865 df-iun 4911 df-br 5059 df-opab 5121 df-mpt 5141 df-tr 5167 df-id 5460 df-eprel 5465 df-po 5473 df-so 5474 df-fr 5514 df-se 5515 df-we 5516 df-xp 5562 df-rel 5563 df-cnv 5564 df-co 5565 df-dm 5566 df-rn 5567 df-res 5568 df-ima 5569 df-pred 6165 df-ord 6221 df-on 6222 df-suc 6224 df-iota 6343 df-fun 6387 df-fn 6388 df-f 6389 df-f1 6390 df-fo 6391 df-f1o 6392 df-fv 6393 df-isom 6394 df-riota 7175 df-wrecs 8052 df-recs 8113 df-ixp 8584 df-en 8632 df-card 9560 df-ac 9735 |
This theorem is referenced by: konigthlem 10187 |
Copyright terms: Public domain | W3C validator |