Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > addnqprlemfl | Unicode version |
Description: Lemma for addnqpr 7464. The forward subset relationship for the lower cut. (Contributed by Jim Kingdon, 19-Aug-2020.) |
Ref | Expression |
---|---|
addnqprlemfl |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | addnqprlemru 7461 | . . . . . 6 | |
2 | ltsonq 7301 | . . . . . . . . 9 | |
3 | addclnq 7278 | . . . . . . . . 9 | |
4 | sonr 4276 | . . . . . . . . 9 | |
5 | 2, 3, 4 | sylancr 411 | . . . . . . . 8 |
6 | ltrelnq 7268 | . . . . . . . . . . . 12 | |
7 | 6 | brel 4635 | . . . . . . . . . . 11 |
8 | 7 | simpld 111 | . . . . . . . . . 10 |
9 | elex 2723 | . . . . . . . . . 10 | |
10 | 8, 9 | syl 14 | . . . . . . . . 9 |
11 | breq2 3969 | . . . . . . . . 9 | |
12 | 10, 11 | elab3 2864 | . . . . . . . 8 |
13 | 5, 12 | sylnibr 667 | . . . . . . 7 |
14 | ltnqex 7452 | . . . . . . . . 9 | |
15 | gtnqex 7453 | . . . . . . . . 9 | |
16 | 14, 15 | op2nd 6089 | . . . . . . . 8 |
17 | 16 | eleq2i 2224 | . . . . . . 7 |
18 | 13, 17 | sylnibr 667 | . . . . . 6 |
19 | 1, 18 | ssneldd 3131 | . . . . 5 |
20 | 19 | adantr 274 | . . . 4 |
21 | nqprlu 7450 | . . . . . . 7 | |
22 | nqprlu 7450 | . . . . . . 7 | |
23 | addclpr 7440 | . . . . . . 7 | |
24 | 21, 22, 23 | syl2an 287 | . . . . . 6 |
25 | prop 7378 | . . . . . 6 | |
26 | 24, 25 | syl 14 | . . . . 5 |
27 | vex 2715 | . . . . . . 7 | |
28 | breq1 3968 | . . . . . . 7 | |
29 | 14, 15 | op1st 6088 | . . . . . . 7 |
30 | 27, 28, 29 | elab2 2860 | . . . . . 6 |
31 | 30 | biimpi 119 | . . . . 5 |
32 | prloc 7394 | . . . . 5 | |
33 | 26, 31, 32 | syl2an 287 | . . . 4 |
34 | 20, 33 | ecased 1331 | . . 3 |
35 | 34 | ex 114 | . 2 |
36 | 35 | ssrdv 3134 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wa 103 wo 698 wcel 2128 cab 2143 cvv 2712 wss 3102 cop 3563 class class class wbr 3965 wor 4254 cfv 5167 (class class class)co 5818 c1st 6080 c2nd 6081 cnq 7183 cplq 7185 cltq 7188 cnp 7194 cpp 7196 |
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 604 ax-in2 605 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-coll 4079 ax-sep 4082 ax-nul 4090 ax-pow 4134 ax-pr 4168 ax-un 4392 ax-setind 4494 ax-iinf 4545 |
This theorem depends on definitions: df-bi 116 df-dc 821 df-3or 964 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-ral 2440 df-rex 2441 df-reu 2442 df-rab 2444 df-v 2714 df-sbc 2938 df-csb 3032 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-nul 3395 df-pw 3545 df-sn 3566 df-pr 3567 df-op 3569 df-uni 3773 df-int 3808 df-iun 3851 df-br 3966 df-opab 4026 df-mpt 4027 df-tr 4063 df-eprel 4248 df-id 4252 df-po 4255 df-iso 4256 df-iord 4325 df-on 4327 df-suc 4330 df-iom 4548 df-xp 4589 df-rel 4590 df-cnv 4591 df-co 4592 df-dm 4593 df-rn 4594 df-res 4595 df-ima 4596 df-iota 5132 df-fun 5169 df-fn 5170 df-f 5171 df-f1 5172 df-fo 5173 df-f1o 5174 df-fv 5175 df-ov 5821 df-oprab 5822 df-mpo 5823 df-1st 6082 df-2nd 6083 df-recs 6246 df-irdg 6311 df-1o 6357 df-2o 6358 df-oadd 6361 df-omul 6362 df-er 6473 df-ec 6475 df-qs 6479 df-ni 7207 df-pli 7208 df-mi 7209 df-lti 7210 df-plpq 7247 df-mpq 7248 df-enq 7250 df-nqqs 7251 df-plqqs 7252 df-mqqs 7253 df-1nqqs 7254 df-rq 7255 df-ltnqqs 7256 df-enq0 7327 df-nq0 7328 df-0nq0 7329 df-plq0 7330 df-mq0 7331 df-inp 7369 df-iplp 7371 |
This theorem is referenced by: addnqpr 7464 |
Copyright terms: Public domain | W3C validator |