| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dedekindeulemeu | Unicode version | ||
| Description: Lemma for dedekindeu 15128. Part of proving uniqueness. (Contributed by Jim Kingdon, 31-Jan-2024.) |
| Ref | Expression |
|---|---|
| dedekindeu.lss |
|
| dedekindeu.uss |
|
| dedekindeu.lm |
|
| dedekindeu.um |
|
| dedekindeu.lr |
|
| dedekindeu.ur |
|
| dedekindeu.disj |
|
| dedekindeu.loc |
|
| dedekindeulemeu.are |
|
| dedekindeulemeu.ac |
|
| dedekindeulemeu.bre |
|
| dedekindeulemeu.bc |
|
| dedekindeulemeu.lt |
|
| Ref | Expression |
|---|---|
| dedekindeulemeu |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 4048 |
. . . 4
| |
| 2 | dedekindeulemeu.ac |
. . . . . 6
| |
| 3 | 2 | simpld 112 |
. . . . 5
|
| 4 | 3 | adantr 276 |
. . . 4
|
| 5 | simpr 110 |
. . . 4
| |
| 6 | 1, 4, 5 | rspcdva 2882 |
. . 3
|
| 7 | dedekindeulemeu.are |
. . . . 5
| |
| 8 | 7 | ltnrd 8186 |
. . . 4
|
| 9 | 8 | adantr 276 |
. . 3
|
| 10 | 6, 9 | pm2.21fal 1393 |
. 2
|
| 11 | breq2 4049 |
. . . 4
| |
| 12 | dedekindeulemeu.bc |
. . . . . 6
| |
| 13 | 12 | simprd 114 |
. . . . 5
|
| 14 | 13 | adantr 276 |
. . . 4
|
| 15 | simpr 110 |
. . . 4
| |
| 16 | 11, 14, 15 | rspcdva 2882 |
. . 3
|
| 17 | dedekindeulemeu.bre |
. . . . 5
| |
| 18 | 17 | ltnrd 8186 |
. . . 4
|
| 19 | 18 | adantr 276 |
. . 3
|
| 20 | 16, 19 | pm2.21fal 1393 |
. 2
|
| 21 | dedekindeulemeu.lt |
. . 3
| |
| 22 | breq2 4049 |
. . . . 5
| |
| 23 | eleq1 2268 |
. . . . . 6
| |
| 24 | 23 | orbi2d 792 |
. . . . 5
|
| 25 | 22, 24 | imbi12d 234 |
. . . 4
|
| 26 | breq1 4048 |
. . . . . . 7
| |
| 27 | eleq1 2268 |
. . . . . . . 8
| |
| 28 | 27 | orbi1d 793 |
. . . . . . 7
|
| 29 | 26, 28 | imbi12d 234 |
. . . . . 6
|
| 30 | 29 | ralbidv 2506 |
. . . . 5
|
| 31 | dedekindeu.loc |
. . . . 5
| |
| 32 | 30, 31, 7 | rspcdva 2882 |
. . . 4
|
| 33 | 25, 32, 17 | rspcdva 2882 |
. . 3
|
| 34 | 21, 33 | mpd 13 |
. 2
|
| 35 | 10, 20, 34 | mpjaodan 800 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-sep 4163 ax-pow 4219 ax-pr 4254 ax-un 4481 ax-setind 4586 ax-cnex 8018 ax-resscn 8019 ax-pre-ltirr 8039 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-nel 2472 df-ral 2489 df-rex 2490 df-rab 2493 df-v 2774 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-br 4046 df-opab 4107 df-xp 4682 df-pnf 8111 df-mnf 8112 df-ltxr 8114 |
| This theorem is referenced by: dedekindeu 15128 |
| Copyright terms: Public domain | W3C validator |