![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eluz2 | GIF version |
Description: Membership in an upper set of integers. We use the fact that a function's value (under our function value definition) is empty outside of its domain to show 𝑀 ∈ ℤ. (Contributed by NM, 5-Sep-2005.) (Revised by Mario Carneiro, 3-Nov-2013.) |
Ref | Expression |
---|---|
eluz2 | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluzel2 9535 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
2 | simp1 997 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈ ℤ) | |
3 | eluz1 9534 | . . . 4 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))) | |
4 | ibar 301 | . . . 4 ⊢ (𝑀 ∈ ℤ → ((𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) ↔ (𝑀 ∈ ℤ ∧ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)))) | |
5 | 3, 4 | bitrd 188 | . . 3 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)))) |
6 | 3anass 982 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) ↔ (𝑀 ∈ ℤ ∧ (𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))) | |
7 | 5, 6 | bitr4di 198 | . 2 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁))) |
8 | 1, 2, 7 | pm5.21nii 704 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 ∧ w3a 978 ∈ wcel 2148 class class class wbr 4005 ‘cfv 5218 ≤ cle 7995 ℤcz 9255 ℤ≥cuz 9530 |
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-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-cnex 7904 ax-resscn 7905 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-rab 2464 df-v 2741 df-sbc 2965 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-br 4006 df-opab 4067 df-mpt 4068 df-id 4295 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-fv 5226 df-ov 5880 df-neg 8133 df-z 9256 df-uz 9531 |
This theorem is referenced by: eluzuzle 9538 eluzelz 9539 eluzle 9542 uztrn 9546 eluzp1p1 9555 uznn0sub 9561 uz3m2nn 9575 1eluzge0 9576 2eluzge1 9578 raluz2 9581 rexuz2 9583 peano2uz 9585 nn0pzuz 9589 uzind4 9590 nn0ge2m1nnALT 9620 elfzuzb 10021 uzsubsubfz 10049 ige2m1fz 10112 4fvwrd4 10142 elfzo2 10152 elfzouz2 10163 fzossrbm1 10175 fzossfzop1 10214 ssfzo12bi 10227 elfzonelfzo 10232 elfzomelpfzo 10233 fzosplitprm1 10236 fzostep1 10239 fzind2 10241 flqword2 10291 fldiv4p1lem1div2 10307 uzennn 10438 seq3split 10481 iseqf1olemqk 10496 seq3f1olemqsumkj 10500 seq3f1olemqsumk 10501 seq3f1olemqsum 10502 bcval5 10745 seq3coll 10824 seq3shft 10849 resqrexlemoverl 11032 resqrexlemga 11034 fsum3cvg3 11406 fisumrev2 11456 isumshft 11500 cvgratnnlemseq 11536 cvgratnnlemabsle 11537 cvgratnnlemsumlt 11538 cvgratz 11542 oddge22np1 11888 nn0o 11914 suprzubdc 11955 zsupssdc 11957 uzwodc 12040 dvdsnprmd 12127 prmgt1 12134 oddprmgt2 12136 oddprmge3 12137 prm23ge5 12266 nninfdclemcl 12451 nninfdclemp1 12453 nninfdclemlt 12454 strleund 12564 strleun 12565 cnfldstr 13542 2logb9irr 14474 2logb9irrap 14480 lgsdilem2 14522 |
Copyright terms: Public domain | W3C validator |