Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > acexmidlemcase | Unicode version |
Description: Lemma for acexmid 5511. Here we divide the proof into cases (based
on the
disjunction implicit in an unordered pair, not the sort of case
elimination which relies on excluded middle).
The cases are (1) the choice function evaluated at equals , (2) the choice function evaluated at equals , and (3) the choice function evaluated at equals and the choice function evaluated at equals . Because of the way we represent the choice function , the choice function evaluated at is and the choice function evaluated at is . Other than the difference in notation these work just as and would if were a function as defined by df-fun 4904. Although it isn't exactly about the division into cases, it is also convenient for this lemma to also include the step that if the choice function evaluated at equals , then and likewise for . (Contributed by Jim Kingdon, 7-Aug-2019.) |
Ref | Expression |
---|---|
acexmidlem.a | |
acexmidlem.b | |
acexmidlem.c |
Ref | Expression |
---|---|
acexmidlemcase |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | acexmidlem.a | . . . . . . . . . . . . . 14 | |
2 | onsucelsucexmidlem 4254 | . . . . . . . . . . . . . 14 | |
3 | 1, 2 | eqeltri 2110 | . . . . . . . . . . . . 13 |
4 | prid1g 3474 | . . . . . . . . . . . . 13 | |
5 | 3, 4 | ax-mp 7 | . . . . . . . . . . . 12 |
6 | acexmidlem.c | . . . . . . . . . . . 12 | |
7 | 5, 6 | eleqtrri 2113 | . . . . . . . . . . 11 |
8 | eleq1 2100 | . . . . . . . . . . . . . . 15 | |
9 | 8 | anbi1d 438 | . . . . . . . . . . . . . 14 |
10 | 9 | rexbidv 2327 | . . . . . . . . . . . . 13 |
11 | 10 | reueqd 2515 | . . . . . . . . . . . 12 |
12 | 11 | rspcv 2652 | . . . . . . . . . . 11 |
13 | 7, 12 | ax-mp 7 | . . . . . . . . . 10 |
14 | riotacl 5482 | . . . . . . . . . 10 | |
15 | 13, 14 | syl 14 | . . . . . . . . 9 |
16 | elrabi 2695 | . . . . . . . . . 10 | |
17 | 16, 1 | eleq2s 2132 | . . . . . . . . 9 |
18 | elpri 3398 | . . . . . . . . 9 | |
19 | 15, 17, 18 | 3syl 17 | . . . . . . . 8 |
20 | eleq1 2100 | . . . . . . . . . 10 | |
21 | 15, 20 | syl5ibcom 144 | . . . . . . . . 9 |
22 | 21 | orim2d 702 | . . . . . . . 8 |
23 | 19, 22 | mpd 13 | . . . . . . 7 |
24 | acexmidlem.b | . . . . . . . . . . . . . 14 | |
25 | pp0ex 3940 | . . . . . . . . . . . . . . 15 | |
26 | 25 | rabex 3901 | . . . . . . . . . . . . . 14 |
27 | 24, 26 | eqeltri 2110 | . . . . . . . . . . . . 13 |
28 | 27 | prid2 3477 | . . . . . . . . . . . 12 |
29 | 28, 6 | eleqtrri 2113 | . . . . . . . . . . 11 |
30 | eleq1 2100 | . . . . . . . . . . . . . . 15 | |
31 | 30 | anbi1d 438 | . . . . . . . . . . . . . 14 |
32 | 31 | rexbidv 2327 | . . . . . . . . . . . . 13 |
33 | 32 | reueqd 2515 | . . . . . . . . . . . 12 |
34 | 33 | rspcv 2652 | . . . . . . . . . . 11 |
35 | 29, 34 | ax-mp 7 | . . . . . . . . . 10 |
36 | riotacl 5482 | . . . . . . . . . 10 | |
37 | 35, 36 | syl 14 | . . . . . . . . 9 |
38 | elrabi 2695 | . . . . . . . . . 10 | |
39 | 38, 24 | eleq2s 2132 | . . . . . . . . 9 |
40 | elpri 3398 | . . . . . . . . 9 | |
41 | 37, 39, 40 | 3syl 17 | . . . . . . . 8 |
42 | eleq1 2100 | . . . . . . . . . 10 | |
43 | 37, 42 | syl5ibcom 144 | . . . . . . . . 9 |
44 | 43 | orim1d 701 | . . . . . . . 8 |
45 | 41, 44 | mpd 13 | . . . . . . 7 |
46 | 23, 45 | jca 290 | . . . . . 6 |
47 | anddi 734 | . . . . . 6 | |
48 | 46, 47 | sylib 127 | . . . . 5 |
49 | simpl 102 | . . . . . . 7 | |
50 | simpl 102 | . . . . . . 7 | |
51 | 49, 50 | jaoi 636 | . . . . . 6 |
52 | 51 | orim2i 678 | . . . . 5 |
53 | 48, 52 | syl 14 | . . . 4 |
54 | 53 | orcomd 648 | . . 3 |
55 | simpr 103 | . . . . 5 | |
56 | 55 | orim1i 677 | . . . 4 |
57 | 56 | orim2i 678 | . . 3 |
58 | 54, 57 | syl 14 | . 2 |
59 | 3orass 888 | . 2 | |
60 | 58, 59 | sylibr 137 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wo 629 w3o 884 wceq 1243 wcel 1393 wral 2306 wrex 2307 wreu 2308 crab 2310 cvv 2557 c0 3224 csn 3375 cpr 3376 con0 4100 crio 5467 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-nul 3883 ax-pow 3927 |
This theorem depends on definitions: df-bi 110 df-3or 886 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-eu 1903 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-uni 3581 df-tr 3855 df-iord 4103 df-on 4105 df-suc 4108 df-iota 4867 df-riota 5468 |
This theorem is referenced by: acexmidlem1 5508 |
Copyright terms: Public domain | W3C validator |