Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > unsnfidcex | Unicode version |
Description: The condition in unsnfi 6775. This is intended to show that unsnfi 6775 without that condition would not be provable but it probably would need to be strengthened (for example, to imply included middle) to fully show that. (Contributed by Jim Kingdon, 6-Feb-2022.) |
Ref | Expression |
---|---|
unsnfidcex | DECID |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isfi 6623 | . . . . 5 | |
2 | 1 | biimpi 119 | . . . 4 |
3 | 2 | 3ad2ant1 987 | . . 3 |
4 | isfi 6623 | . . . . . . 7 | |
5 | 4 | biimpi 119 | . . . . . 6 |
6 | 5 | 3ad2ant3 989 | . . . . 5 |
7 | 6 | adantr 274 | . . . 4 |
8 | simprr 506 | . . . . . . . . . 10 | |
9 | 8 | ad3antrrr 483 | . . . . . . . . 9 |
10 | simplr 504 | . . . . . . . . 9 | |
11 | 9, 10 | breqtrrd 3926 | . . . . . . . 8 |
12 | simprr 506 | . . . . . . . . . 10 | |
13 | 12 | ad2antrr 479 | . . . . . . . . 9 |
14 | 13 | ensymd 6645 | . . . . . . . 8 |
15 | entr 6646 | . . . . . . . 8 | |
16 | 11, 14, 15 | syl2anc 408 | . . . . . . 7 |
17 | simp1 966 | . . . . . . . . 9 | |
18 | 17 | ad4antr 485 | . . . . . . . 8 |
19 | simpr 109 | . . . . . . . . 9 | |
20 | simp2 967 | . . . . . . . . . 10 | |
21 | 20 | ad4antr 485 | . . . . . . . . 9 |
22 | 19, 21 | eldifd 3051 | . . . . . . . 8 |
23 | php5fin 6744 | . . . . . . . 8 | |
24 | 18, 22, 23 | syl2anc 408 | . . . . . . 7 |
25 | 16, 24 | pm2.65da 635 | . . . . . 6 |
26 | 25 | orcd 707 | . . . . 5 |
27 | 8 | ad3antrrr 483 | . . . . . . . . . . 11 |
28 | 27 | ensymd 6645 | . . . . . . . . . 10 |
29 | snprc 3558 | . . . . . . . . . . . . . . 15 | |
30 | 29 | biimpi 119 | . . . . . . . . . . . . . 14 |
31 | 30 | uneq2d 3200 | . . . . . . . . . . . . 13 |
32 | un0 3366 | . . . . . . . . . . . . 13 | |
33 | 31, 32 | syl6eq 2166 | . . . . . . . . . . . 12 |
34 | 33 | adantl 275 | . . . . . . . . . . 11 |
35 | 12 | ad2antrr 479 | . . . . . . . . . . 11 |
36 | 34, 35 | eqbrtrrd 3922 | . . . . . . . . . 10 |
37 | entr 6646 | . . . . . . . . . 10 | |
38 | 28, 36, 37 | syl2anc 408 | . . . . . . . . 9 |
39 | simplrl 509 | . . . . . . . . . . 11 | |
40 | 39 | ad2antrr 479 | . . . . . . . . . 10 |
41 | simprl 505 | . . . . . . . . . . 11 | |
42 | 41 | ad2antrr 479 | . . . . . . . . . 10 |
43 | nneneq 6719 | . . . . . . . . . 10 | |
44 | 40, 42, 43 | syl2anc 408 | . . . . . . . . 9 |
45 | 38, 44 | mpbid 146 | . . . . . . . 8 |
46 | 45 | eqcomd 2123 | . . . . . . 7 |
47 | simplr 504 | . . . . . . 7 | |
48 | 46, 47 | pm2.65da 635 | . . . . . 6 |
49 | 48 | olcd 708 | . . . . 5 |
50 | nndceq 6363 | . . . . . . 7 DECID | |
51 | 41, 39, 50 | syl2anc 408 | . . . . . 6 DECID |
52 | exmiddc 806 | . . . . . 6 DECID | |
53 | 51, 52 | syl 14 | . . . . 5 |
54 | 26, 49, 53 | mpjaodan 772 | . . . 4 |
55 | 7, 54 | rexlimddv 2531 | . . 3 |
56 | 3, 55 | rexlimddv 2531 | . 2 |
57 | df-dc 805 | . 2 DECID | |
58 | 56, 57 | sylibr 133 | 1 DECID |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wa 103 wb 104 wo 682 DECID wdc 804 w3a 947 wceq 1316 wcel 1465 wrex 2394 cvv 2660 cdif 3038 cun 3039 c0 3333 csn 3497 class class class wbr 3899 com 4474 cen 6600 cfn 6602 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-nul 4024 ax-pow 4068 ax-pr 4101 ax-un 4325 ax-setind 4422 ax-iinf 4472 |
This theorem depends on definitions: df-bi 116 df-dc 805 df-3or 948 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-ral 2398 df-rex 2399 df-rab 2402 df-v 2662 df-sbc 2883 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-nul 3334 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-int 3742 df-br 3900 df-opab 3960 df-tr 3997 df-id 4185 df-iord 4258 df-on 4260 df-suc 4263 df-iom 4475 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-res 4521 df-ima 4522 df-iota 5058 df-fun 5095 df-fn 5096 df-f 5097 df-f1 5098 df-fo 5099 df-f1o 5100 df-fv 5101 df-1o 6281 df-er 6397 df-en 6603 df-fin 6605 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |