Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > frminex | Structured version Visualization version Unicode version |
Description: If an element of a well-founded set satisfies a property , then there is a minimal element that satisfies . (Contributed by Jeff Madsen, 18-Jun-2010.) (Proof shortened by Mario Carneiro, 18-Nov-2016.) |
Ref | Expression |
---|---|
frminex.1 | |
frminex.2 |
Ref | Expression |
---|---|
frminex |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabn0 3958 | . 2 | |
2 | frminex.1 | . . . . 5 | |
3 | 2 | rabex 4813 | . . . 4 |
4 | ssrab2 3687 | . . . 4 | |
5 | fri 5076 | . . . . . 6 | |
6 | frminex.2 | . . . . . . . . 9 | |
7 | 6 | ralrab 3368 | . . . . . . . 8 |
8 | 7 | rexbii 3041 | . . . . . . 7 |
9 | breq2 4657 | . . . . . . . . . . 11 | |
10 | 9 | notbid 308 | . . . . . . . . . 10 |
11 | 10 | imbi2d 330 | . . . . . . . . 9 |
12 | 11 | ralbidv 2986 | . . . . . . . 8 |
13 | 12 | rexrab2 3374 | . . . . . . 7 |
14 | 8, 13 | bitri 264 | . . . . . 6 |
15 | 5, 14 | sylib 208 | . . . . 5 |
16 | 15 | an4s 869 | . . . 4 |
17 | 3, 4, 16 | mpanl12 718 | . . 3 |
18 | 17 | ex 450 | . 2 |
19 | 1, 18 | syl5bir 233 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wb 196 wa 384 wcel 1990 wne 2794 wral 2912 wrex 2913 crab 2916 cvv 3200 wss 3574 c0 3915 class class class wbr 4653 wfr 5070 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-fr 5073 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |