| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1228 | Structured version Visualization version GIF version | ||
| Description: Existence of a minimal element in certain classes: if 𝑅 is well-founded and set-like on 𝐴, then every nonempty subclass of 𝐴 has a minimal element. The proof has been taken from Chapter 4 of Don Monk's notes on Set Theory. See http://euclid.colorado.edu/~monkd/setth.pdf. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj1228.1 | ⊢ (𝑤 ∈ 𝐵 → ∀𝑥 𝑤 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| bnj1228 | ⊢ ((𝑅 FrSe 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj69 35207 | . 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧) | |
| 2 | nfv 1922 | . . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) | |
| 3 | bnj1228.1 | . . . . . . 7 ⊢ (𝑤 ∈ 𝐵 → ∀𝑥 𝑤 ∈ 𝐵) | |
| 4 | 3 | nfcii 2892 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 |
| 5 | 4 | nfcri 2895 | . . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐵 |
| 6 | nfv 1922 | . . . . . 6 ⊢ Ⅎ𝑥 ¬ 𝑦𝑅𝑧 | |
| 7 | 4, 6 | nfralw 3288 | . . . . 5 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧 |
| 8 | 5, 7 | nfan 1907 | . . . 4 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧) |
| 9 | eleq1w 2824 | . . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐵 ↔ 𝑧 ∈ 𝐵)) | |
| 10 | breq2 5079 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝑧)) | |
| 11 | 10 | notbid 320 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝑧)) |
| 12 | 11 | ralbidv 3164 | . . . . 5 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)) |
| 13 | 9, 12 | anbi12d 639 | . . . 4 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) ↔ (𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧))) |
| 14 | 2, 8, 13 | cbvexv1 2352 | . . 3 ⊢ (∃𝑥(𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)) |
| 15 | df-rex 3066 | . . 3 ⊢ (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)) | |
| 16 | df-rex 3066 | . . 3 ⊢ (∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧 ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)) | |
| 17 | 14, 15, 16 | 3bitr4i 305 | . 2 ⊢ (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ↔ ∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧) |
| 18 | 1, 17 | sylibr 236 | 1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∧ w3a 1093 ∀wal 1546 ∃wex 1787 ∈ wcel 2121 ≠ wne 2936 ∀wral 3055 ∃wrex 3065 ⊆ wss 3885 ∅c0 4264 class class class wbr 5075 FrSe w-bnj15 34890 |
| 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 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-reg 9501 ax-inf2 9557 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 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-ord 6317 df-on 6318 df-lim 6319 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-om 7811 df-1o 8399 df-bnj17 34885 df-bnj14 34887 df-bnj13 34889 df-bnj15 34891 df-bnj18 34893 df-bnj19 34895 |
| This theorem is referenced by: bnj1204 35209 bnj1311 35221 bnj1312 35255 |
| Copyright terms: Public domain | W3C validator |