| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ttukey | Structured version Visualization version GIF version | ||
| Description: The Teichmüller-Tukey Lemma, an Axiom of Choice equivalent. If 𝐴 is a nonempty collection of finite character, then 𝐴 has a maximal element with respect to inclusion. Here "finite character" means that 𝑥 ∈ 𝐴 iff every finite subset of 𝑥 is in 𝐴. (Contributed by Mario Carneiro, 15-May-2015.) |
| Ref | Expression |
|---|---|
| ttukey.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| ttukey | ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ttukey.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | 1 | uniex 7696 | . . 3 ⊢ ∪ 𝐴 ∈ V |
| 3 | numth3 10392 | . . 3 ⊢ (∪ 𝐴 ∈ V → ∪ 𝐴 ∈ dom card) | |
| 4 | 2, 3 | ax-mp 5 | . 2 ⊢ ∪ 𝐴 ∈ dom card |
| 5 | ttukeyg 10439 | . 2 ⊢ ((∪ 𝐴 ∈ dom card ∧ 𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) | |
| 6 | 4, 5 | mp3an1 1451 | 1 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1540 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ∃wrex 3062 Vcvv 3442 ∩ cin 3902 ⊆ wss 3903 ⊊ wpss 3904 ∅c0 4287 𝒫 cpw 4556 ∪ cuni 4865 dom cdm 5632 Fincfn 8895 cardccrd 9859 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-ac2 10385 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-1o 8407 df-er 8645 df-en 8896 df-dom 8897 df-fin 8899 df-card 9863 df-ac 10038 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |