| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ttukeyg | Structured version Visualization version GIF version | ||
| Description: The Teichmüller-Tukey Lemma ttukey 10596 stated with the "choice" as an antecedent (the hypothesis ∪ 𝐴 ∈ dom card says that ∪ 𝐴 is well-orderable). (Contributed by Mario Carneiro, 15-May-2015.) |
| Ref | Expression |
|---|---|
| ttukeyg | ⊢ ((∪ 𝐴 ∈ dom card ∧ 𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4299 | . . 3 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝐴) | |
| 2 | ttukey2g 10594 | . . . . . 6 ⊢ ((∪ 𝐴 ∈ dom card ∧ 𝑧 ∈ 𝐴 ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 (𝑧 ⊆ 𝑥 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦)) | |
| 3 | simpr 490 | . . . . . . 7 ⊢ ((𝑧 ⊆ 𝑥 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) → ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) | |
| 4 | 3 | reximi 3100 | . . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 (𝑧 ⊆ 𝑥 ∧ ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| 5 | 2, 4 | syl 18 | . . . . 5 ⊢ ((∪ 𝐴 ∈ dom card ∧ 𝑧 ∈ 𝐴 ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| 6 | 5 | 3exp 1137 | . . . 4 ⊢ (∪ 𝐴 ∈ dom card → (𝑧 ∈ 𝐴 → (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦))) |
| 7 | 6 | exlimdv 1965 | . . 3 ⊢ (∪ 𝐴 ∈ dom card → (∃𝑧 𝑧 ∈ 𝐴 → (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦))) |
| 8 | 1, 7 | biimtrid 245 | . 2 ⊢ (∪ 𝐴 ∈ dom card → (𝐴 ≠ ∅ → (∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦))) |
| 9 | 8 | 3imp 1128 | 1 ⊢ ((∪ 𝐴 ∈ dom card ∧ 𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ∀wal 1567 ∃wex 1811 ∈ wcel 2144 ≠ wne 2955 ∀wral 3076 ∃wrex 3086 ⊆ wss 3895 ⊊ wpss 4013 ∩ cin 4089 ∅c0 4278 𝒫 cpw 4556 ∪ cuni 4866 dom cdm 5650 Fincfn 8973 cardccrd 10016 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-1o 8476 df-er 8717 df-en 8974 df-dom 8975 df-fin 8977 df-card 10020 |
| This theorem is used by: ttukey 10596 |
| Copyright terms: Public domain | W3C validator |