| 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 10383 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)) |
| 4 | n0 4302 | . . . 4 ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ ∃𝑓 𝑓 ∈ X𝑥 ∈ 𝐴 𝐵) | |
| 5 | vex 3441 | . . . . . 6 ⊢ 𝑓 ∈ V | |
| 6 | 5 | elixp 8838 | . . . . 5 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)) |
| 7 | 6 | exbii 1849 | . . . 4 ⊢ (∃𝑓 𝑓 ∈ X𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)) |
| 8 | 4, 7 | bitr2i 276 | . . 3 ⊢ (∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) ↔ X𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
| 9 | 3, 8 | sylib 218 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ → X𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
| 10 | ixpn0 8864 | . 2 ⊢ (X𝑥 ∈ 𝐴 𝐵 ≠ ∅ → ∀𝑥 ∈ 𝐴 𝐵 ≠ ∅) | |
| 11 | 9, 10 | impbii 209 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ≠ ∅ ↔ X𝑥 ∈ 𝐴 𝐵 ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∃wex 1780 ∈ wcel 2113 ≠ wne 2929 ∀wral 3048 Vcvv 3437 ∅c0 4282 Fn wfn 6484 ‘cfv 6489 Xcixp 8831 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-ac2 10365 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-se 5575 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-isom 6498 df-riota 7312 df-ov 7358 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-ixp 8832 df-en 8880 df-card 9843 df-ac 10018 |
| This theorem is referenced by: konigthlem 10470 |
| Copyright terms: Public domain | W3C validator |